The primitive Boolean matrices with the second largest scrambling index by Boolean rank
Tóm tắt
The scrambling index of an n × n primitive Boolean matrix A is the smallest positive integer k such that A
k
(A
T)
k
= J, where A
T denotes the transpose of A and J denotes the n×n all ones matrix. For an m×n Boolean matrix M, its Boolean rank b(M) is the smallest positive integer b such that M = AB for some m × b Boolean matrix A and b×n Boolean matrix B. In 2009, M. Akelbek, S. Fital, and J. Shen gave an upper bound on the scrambling index of an n×n primitive matrix M in terms of its Boolean rank b(M), and they also characterized all primitive matrices that achieve the upper bound. In this paper, we characterize primitive Boolean matrices that achieve the second largest scrambling index in terms of their Boolean rank.
Tài liệu tham khảo
M. Akelbek, S. Kirkland: Coefficients of ergodicity and the scrambling index. Linear Algebra Appl. 430 (2009), 1111–1130.
M. Akelbek, S. Fital, J. Shen: A bound on the scrambling index of a primitive matrix using Boolean rank. Linear Algebra Appl. 431 (2009), 1923–1931.
R. A. Brualdi, H. J. Ryser: Combinatorial Matrix Theory. Encyclopedia of Mathematics and its Applications 39, Cambridge University Press, Cambridge, 1991.
B. L. Liu, L. H. You, G. X. Yu: On extremal matrices of second largest exponent by Boolean rank. Linear Algebra Appl. 422 (2007), 186–197.
Y. Shao, Y. Gao: On the second largest scrambling index of primitive matrices. Ars Comb. 113 (2014), 457–462.