For a given finite set Σ of matrices with nonnegative integer entries we study the growth with t ofmax A1 ⯠At norm of matrix : Ai â Σ .We show how to determine in polynomial time whether this growth is bounded, polynomial, or exponential, and we characterize all possible behaviors. © 2007 Elsevier Inc. All rights reserved.
Efficient algorithms for deciding the type of growth of products of integer matrices
Protasov, Vladimir;
2008-01-01
Abstract
For a given finite set Σ of matrices with nonnegative integer entries we study the growth with t ofmax A1 ⯠At norm of matrix : Ai â Σ .We show how to determine in polynomial time whether this growth is bounded, polynomial, or exponential, and we characterize all possible behaviors. © 2007 Elsevier Inc. All rights reserved.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
