On the index of convergence of an irreducible Boolean matrix (Q1096697): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Kim Hang Kim / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Kim Hang Kim / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(87)90149-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064759670 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3943082 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Structure of Powers of Nonnegative Matrices I. The Index of Convergence / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3958592 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5632793 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matrices permutation equivalent to primitive matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unzerlegbare, nicht negative Matrizen / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:58, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the index of convergence of an irreducible Boolean matrix |
scientific article |
Statements
On the index of convergence of an irreducible Boolean matrix (English)
0 references
1987
0 references
The authors prove Schwarz's upper bound for the index of a Boolean matrix of specified period and size by a new method and they show this bound is best possible in all cases.
0 references
index of convergence
0 references
irreducible Boolean matrix
0 references
upper bound for the index
0 references
