A bound on the exponent of a primitive matrix using Boolean rank

From MaRDI portal
(Redirected from Publication:1805313)





The authors prove that the exponent (also called index of primitivity) of a Boolean matrix of Boolean rank (also called Schein rank) \(b\) is at most \((b- 1)^ 2+ 2\), and that this bound can be attained for all dimensions \(n\) greater than \(b\).











This page was built for publication: A bound on the exponent of a primitive matrix using Boolean rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805313)