Abstract
In this note we use Boolean models to generate new results in Combinatorics. On the one hand, the new results answer actual questions which have not been solved so far. On the other hand, the new results can immediately be useful for future applications. We emphasize a new sequence of numbers which we call, due to the analyzed problem, the sequence of Bishop Numbers.
The study of the methodology applied leads to a new fruitful observation. Any problem that can be converted into a Boolean model can be solved for a broad range of parameters in a constructive way. Thus, it is not only known that there are solutions, the results will be fully available as well. This relates particularly to all constraint-related problems, even when the Boolean models are quite complex.
Get full access to this article
View all access options for this article.