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

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.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11697/123646
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 42
  • ???jsp.display-item.citation.isi??? 36
social impact