A bound on the exponent of a primitive matrix using Boolean rank (Q1805313): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037504144 / rank | |||
Normal rank | |||
Revision as of 20:56, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bound on the exponent of a primitive matrix using Boolean rank |
scientific article |
Statements
A bound on the exponent of a primitive matrix using Boolean rank (English)
0 references
11 May 1995
0 references
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\).
0 references
exponent
0 references
index of primitivity
0 references
Boolean matrix
0 references
Boolean rank
0 references
Schein rank
0 references
