A bound on the exponent of a primitive matrix using Boolean rank (Q1805313)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A bound on the exponent of a primitive matrix using Boolean rank |
scientific article; zbMATH DE number 754000
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bound on the exponent of a primitive matrix using Boolean rank |
scientific article; zbMATH DE number 754000 |
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
0 references
0 references
0.9195304
0 references
0.9191142
0 references
0.9063896
0 references
0.9006753
0 references
0 references
0.89267385
0 references
