International Journal of Modern Education and Computer Science (IJMECS)
IJMECS Vol. 5, No. 4, 8 Apr. 2013
Cover page and Table of Contents: PDF (size: 287KB)
Bitwise Operations Related to a Combinatorial Problem on Binary Matrices
Full Text (PDF, 287KB), PP.19-24
Views: 0 Downloads: 0
Author(s)
Index Terms
Programming language, bitwise operations, isomorphism-free generations of combinatorial objects, binary matrix, equivalence relation, factor-set, cardinality.
Abstract
Some techniques for the use of bitwise operations are described in the article. As an example, an open problem of isomorphism-free generations of combinatorial objects is discussed. An equivalence relation on the set of square binary matrices having the same number of units in each row and each column is defined. Each binary matrix is represented using ordered n-tuples of natural numbers. It is shown how by using the bitwise operations can be implemented an algorithm that gets canonical representatives which are extremal elements of equivalence classes relative to a double order on the set of considered objects.
Cite This Paper
Krasimir Yankov Yordzhev, "Bitwise Operations Related to a Combinatorial Problem on Binary Matrices", International Journal of Modern Education and Computer Science (IJMECS), vol.5, no.4, pp.19-24, 2013. DOI:10.5815/ijmecs.2013.04.03
Reference
[1]K. Yordzhev, An example for the use of bitwise operations in programming: Mathematics and education in mathematics, 38 (2009), 196-202.
[2]I. Bouyukliev, About Algorithms for Isomorphism-free generations of Combinatorial objects: Mathematics and education in mathematics, 38 (2009), 51-60.
[3]V. E. Tarakanov, Combinatorial problems on binary matrices: Combinatorial Analysis, Moscow, Moscow State University, 5 (1980), 4-15 (in Russian).
[4]H. Anand, V. C. Dumir and H. Gupta, A combinatorial distribution problem: Duke Math. J. 33 (1966), 757-769.
[5]H. Gupta and G. L. Nath, Enumeration of stochastic cubes: Notices of the Amer. Math. Soc. 19 (1972) A-568.
[6]I. Good and J. Grook, The enumeration of arrays and generalization related to contingency tables: Discrete Math, 19 (1977), 23-45.
[7]K. Yordzhev, Combinatorial problems on binary matrices: Mathematics and education in mathematics, 24 (1995), 288-296.
[8]M. L. Stein and P. R. Stein, Enumeration of stochastic matrices with integer elements: Los Alamos Scientific Laboratory Report LA-4434, 1970.
[9]R. P. Stanley, Enumerative combinatorics. V.1, Wadword & Brooks, California, 1986.
[10]S.R. Davis, C++ for dummies. IDG Books Worldwide, 2000.
[11]B.W. Kernigan, D.M. Ritchie, The C programming Language. AT&T Bell Laboratories, 1998.
[12]H. Schildt, Java 2 A Beginner’s Guide. McGraw-Hill, 2001.
[13]H. Kostadinova and K. Yordzhev, A Representation of Binary Matrices: Mathematics and education in mathematics, 39 (2010), 198-206.