How to Solve Bishop-Problems

Article type: Research Article

Authors: Posthoff, Christian¹ | Steinbach, Bernd²

Affiliations: Trinidad and Tobago and Freiberg, Germany

Note: [1] The University of The West Indies, St. Augustine Campus, Trinidad and Tobago. email: [email protected]

Note: [2] Freiberg University of Mining and Technology, Institute of Computer Science, D-09596 Freiberg, Germany. email: [email protected]

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.

DOI: 10.3233/ICG-2014-37306

Journal: ICGA Journal, vol. 37, no. 3, pp. 169-177, 2014