Efficient algorithms for deciding the type of growth of products of integer matrices

Linear Algebra and Its Applications

Volumn 428, Issue 10, 2008, Pages 2296-2311

  Jungers, Raphaël M ^b   Protasov, Vladimir ^a   Blondel, Vincent D ^b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Binary matrices; Bounded semigroup; Integer matrices; Joint spectral radius; Semigroup of matrices

Indexed keywords

ALGORITHMS; POLYNOMIALS;

BINARY MATRICES; BOUNDED SEMIGROUP; INTEGER MATRICES; JOINT SPECTRAL RADIUS;

MATRIX ALGEBRA;

EID: 40949125172     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2007.08.001     Document Type: Article

References (33)

1. Bell J.P. A gap result for the norms of semigroups of matrices. Linear Algebra Appl. 402 (2005) 101-110
2. Berger M.A., and Wang Y. Bounded semigroups of matrices. J. Linear Algebra Appl. 166 (1992) 21-27
3. Blondel V.D., and Tsitsiklis J.N. The boundedness of all products of a pair of matrices is undecidable. Systems Control Lett. 41 2 (2000) 135-140
4. Blondel V.D., and Canterini V. Undecidable problems for probabilistic automata of fixed dimension. Theory Comput. Syst. 36 (2003) 231-245
5. Blondel V.D., Jungers R., and Protasov V. On the complexity of computing the capacity of codes that avoid forbidden difference patterns. IEEE Trans. Inform. Theory 52 11 (2006) 5122-5127
6. Blondel V.D., and Nesterov Y. Computationally efficient approximations of the joint spectral radius. SIAM J. Matrix Anal. 27 1 (2005) 256-272
7. Blondel V.D., and Tsitsiklis J.N. A survey of computational complexity results in systems and control. Automatica 36 9 (2000) 1249-1274
8. Blondel V.D., Theys J., and Vladimirov A.A. An elementary counterexample to the finiteness conjecture. SIAM J. Matrix Anal. 24 4 (2003) 963-970
9. Mc Naughton R., and Zalcstein Y. The Burnside problem for semigroups. J. Algebra 34 (1975) 292-299
10. Bousch T., and Mairesse J. Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture. J. Amer. Math. Soc. 15 1 (2002) 77-111
11. Collela D., and Heil D. Characterization of scaling functions. I. Continuous solutions. SIAM J. Matrix Analy. Appl. 15 (1994) 496-518
12. V. Crespi, G.V. Cybenko, G. Jiang, The Theory of Trackability with Applications to Sensor Networks. Technical Report TR2005-555, Dartmouth College, Computer Science, Hanover, NH, August 2005.
13. Daubechies I., and Lagarias J.C. Two-scale difference equations. II. Local regularity, infinite products of matrices and fractals. SIAM J. Math. Anal. 23 (1992) 1031-1079
14. de Rham G. Sur les courbes limites de polygones obtenus par trisection. Enseign. Math. II 5 (1959) 29-43
15. Dubuc S. Interpolation through an iterative scheme. J. Math. Anal. Appl. 114 1 (1986) 185-204
16. L. Gurvits, Stability of Linear Inclusions - Part 2. NECI Technical Report TR, 1996, pp. 96-173.
17. He X.G., and Lau K.-S. Characterization of tile digit sets with prime determinants. Appl. Comput. Harmon. Anal. 16 3 (2004) 159-173
18. Jacob G. Un Algorithme Calculant le Cardinal, Fini ou Infini, des Demi-Groupes de Matrices. Theor. Comput. Sci. 5 (1977) 183-204
19. Kozyakin V. Structure of extremal trajectories of discrete linear systems and the finiteness conjecture. Automat. Remote Control 68 1 (2007) 174-209
20. Mandel A., and Simon I. On finite semigroups of matrices. Theor. Comput. Sci. 5 (1977) 101-111
21. Moision B.E., Orlitsky A., and Siegel P.H. On codes with local joint constraints. Linear Algebra Appl. 422 (2007) 442-454
22. B.E. Moision, A. Orlitsky, P.H. Siegel. Bounds on the rate of codes which forbid specified difference sequences. in: Proceedings of 1999 IEEE Global Telecommunications Conference (GLOBECOM '99), December 1999.
23. Moision B.E., Orlitsky A., and Siegel P.H. On codes that avoid specified differences. IEEE Trans. Inform. Theory 47 (2001)
24. Protasov V. The joint spectral radius and invariant sets of linear operators. Fundam. Prikl. Mat. 2 1 (1996) 205-231
25. Protasov V. On the asymptotics of the partition function. Sb. Math. 191 3-4 (2000) 381-414
26. Protasov V. The generalized spectral radius. The geometric approach. Izv. Math. 61 5 (1997) 995-1030
27. Protasov V. Fractal curves and wavelets. Izv. Math. 70 5 (2006) 123-162
28. B. Reznick, Some binary partition functions, in: B.C. Berndt, H.G. Diamond, H. Halberstam, A. Hildebrand (Eds.), Analytic Number Theory. Proceedings of a Conference in Honor of Paul T. Bateman, Birkhäuser, Boston, 1990, pp. 451-477 (MR 91k.11092).
29. Rioul O. Simple regularity criteria for subdivision schemes. SIAM J. Math. Anal. 23 (1999) 1544-1576
30. Tarjan R. Depth first search and linear graph algorithms. SIAM J. Comput. 1 2 (1972) 146-160
31. Tsitsiklis J.N., and Blondel V.D. The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate. Math. Control Signals Systems 10 (1997) 31-40
32. Vinogradov I.M. Elements of Number Theory (1954), Dover Publications, New York (Translated by S. Kravetz)
33. Wirth F. The generalized spectral radius and extremal norms. Linear Algebra Appl. 342 (2000) 17-40