A bound on the scrambling index of a primitive matrix using Boolean rank

From MaRDI portal
Publication:732085




Abstract: The scrambling index of an nimesn primitive matrix A is the smallest positive integer k such that Ak(At)k=J, where At denotes the transpose of A and J denotes the nimesn all ones matrix. For an mimesn Boolean matrix M, its {it Boolean rank} b(M) is the smallest positive integer b such that M=AB for some mimesb Boolean matrix A and bimesn Boolean matrix B. In this paper, we give an upper bound on the scrambling index of an nimesn primitive matrix M in terms of its Boolean rank b(M). Furthermore we characterize all primitive matrices that achieve the upper bound.









This page was built for publication: A bound on the scrambling index 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 Q732085)