Efficient algorithms for deciding the type of growth of products of integer matrices
| dc.creator | Jungers, Raphaël | |
| dc.creator | Protasov, Vladimir | |
| dc.creator | Blondel, Vincent D. | |
| dc.date | 2006-04-11 | |
| dc.date.accessioned | 2026-07-07T07:09:22Z | |
| dc.date.available | 2026-07-07T07:09:22Z | |
| dc.description | For a given finite set $Σ$ of matrices with nonnegative integer entries we study the growth of $$ \max_t(Σ) = \max\{\|A_{1}... A_{t}\|: A_i \in Σ\}.$$ We show how to determine in polynomial time whether the growth with $t$ is bounded, polynomial, or exponential, and we characterize precisely all possible behaviors. | |
| dc.description | 20 pages, 4 figures, submitted to LAA | |
| dc.identifier | https://arxiv.org/abs/cs/0604047 | |
| dc.identifier | http://arxiv.org/abs/cs/0604047 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/111035 | |
| dc.subject | Computational Complexity | |
| dc.title | Efficient algorithms for deciding the type of growth of products of integer matrices | |
| dc.type | text |