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

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

2009-10-11

arxiv.org/abs/0910.2033v1

Linear Algebra and its Applications 431 (2009): 1923-1931

Mathematics

Combinatorics

13 pages, 3 tables

Scientific paper

The scrambling index of an $n\times n$ primitive 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\times n$ all ones matrix. For an $m\times n$ Boolean matrix $M$, its {\it Boolean rank} $b(M)$ is the smallest positive integer $b$ such that $M=AB$ for some $m \times b$ Boolean matrix $A$ and $b\times n$ Boolean matrix $B$. In this paper, we give an upper bound on the scrambling index of an $n\times n$ primitive matrix $M$ in terms of its Boolean rank $b(M)$. Furthermore we characterize all primitive matrices that achieve the upper bound.

Affiliated with

Also associated with

No associations

Rating

A bound on the scrambling index of a primitive matrix using Boolean rank does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A bound on the scrambling index of a primitive matrix using Boolean rank, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A bound on the scrambling index of a primitive matrix using Boolean rank will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-99266