Matrix semigroups with constant spectral radius
Preprint
Abstract
Multiplicative matrix semigroups with constant spectral radius (c.s.r.) are studied and applied to several problems of algebra, combinatorics, functional equations, and dynamical systems. We show that all such semigroups are characterized by means of irreducible ones. Each irreducible c.s.r. semigroup defines walks on Euclidean sphere, all its nonsingular elements are similar (in the same basis) to orthogonal. We classify all nonnegative c.s.r. semigroups and arbitrary low-dimensional semigroups. For higher dimensions, we describe five classes and leave an open problem on completeness of that list. The problem of algorithmic recognition of c.s.r. property is proved to be polynomially solvable for irreducible semigroups and undecidable for reducible ones.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- On matrix semigroups bounded above and belowLinear Algebra and its Applications, 2013
- Efficient algorithms for deciding the type of growth of products of integer matricesLinear Algebra and its Applications, 2008
- The Lyapunov exponent and joint spectral radius of pairs of matrices are hard?when not impossible?to compute and to approximateMathematics of Control, Signals, and Systems, 1997
- Irreducible semigroups with multiplicative spectral radiusLinear Algebra and its Applications, 1997
- Bounded semigroups of matricesLinear Algebra and its Applications, 1992
- Uniform refinement of curvesLinear Algebra and its Applications, 1989
- Absolute characteristic exponent of a class of linear nonstatinoary systems of differential equationsSiberian Mathematical Journal, 1988
- UN algorithme calculant le cardinal, fini ou infini, des demi-groupes de matricesTheoretical Computer Science, 1977
- The Burnside problem for semigroupsJournal of Algebra, 1975
- Matrix algebras and groups relatively bounded in normArchiv der Mathematik, 1959