Abstract

The binary rank of a 0,1 matrix is the smallest size of a partition of its ones into monochromatic combinatorial rectangles. A matrix M is called (k1,…,km;n1,…,nm) circulant block diagonal if it is a block matrix with m diagonal blocks, such that for each i∈[m], the ith diagonal block of M is the circulant matrix whose first row has ki ones followed by ni−ki zeros, and all of whose other entries are zeros. In this work, we study the binary rank of these matrices as well as the binary rank of their complement, obtained by replacing the zeros by ones and the ones by zeros. In particular, we compare the binary rank of these matrices to their rank over the reals, which forms a lower bound on the former.We present a general method for proving upper bounds on the binary rank of block matrices that have diagonal blocks of some specified structure and ones elsewhere. Using this method, we prove that the binary rank of the complement of a (k1,…,km;n1,…,nm) circulant block diagonal matrix for integers satisfying ni>ki>0 for each i∈[m] exceeds its real rank by no more than the maximum of gcd⁡(ni,ki)−1 over all i∈[m]. We further present several sufficient conditions for the binary rank of these matrices to strictly exceed their real rank. By combining the upper and lower bounds, we determine the exact binary rank of various families of matrices and, in addition, significantly generalize a result of Gregory (J. Comb. Math. & Comb. Comp., 1989).Motivated by a question of Pullman (Linear Algebra Appl., 1988), we study the binary rank of k-regular 0,1 matrices, those having precisely k ones in every row and column, and the binary rank of their complement. As an application of our results on circulant block diagonal matrices, we show that for every k≥2, there exist k-regular 0,1 matrices whose binary rank is strictly larger than that of their complement. Furthermore, we exactly determine for every integer r, the smallest possible binary rank of the complement of a 2-regular 0,1 matrix with binary rank r.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.