Spectrum Maximizing Products Are Not Generically Unique

DOI10.1137/23M1550621arXiv2301.12574OpenAlexW4391645206WikidataQ128433059 ScholiaQ128433059MaRDI QIDQ6154945FDOQ6154945

Authors: J. Bochi, Piotr Laskawiec 

Publication date: 16 February 2024

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: It is widely believed that typical finite families of $dimesd$ matrices admit finite products that attain the joint spectral radius. This conjecture is supported by computational experiments and it naturally leads to the following question: are these spectrum maximizing products typically unique, up to cyclic permutations and powers? We answer this question negatively. As discovered by Horowitz around fifty years ago, there are products of matrices that always have the same spectral radius despite not being cyclic permutations of one another. We show that the simplest Horowitz products can be spectrum maximizing in a robust way; more precisely, we exhibit a small but nonempty open subset of pairs of $2imes2$ matrices $(A,B)$ for which the products $A^{2}BA{B}^2$ and $B^{2}AB{A}^2$ are both spectrum maximizing.

Full work available at URL: https://arxiv.org/abs/2301.12574

Recommendations

• On the limit products of a family of matrices
• The joint spectrum
• Optimal norms and the computation of joint spectral radius of matrices
• On the asymptotic properties of a family of matrices

zbMATH Keywords

joint spectral radiusinvariant polytopespectrum maximizing product

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical range, numerical radius (47A12)

Cites Work

• Title not available (Why is that?)
• Elementary geometry in hyperbolic space
• Algebraic unsolvability of problem of absolute stability of desynchronized systems
• The finiteness conjecture for the generalized spectral radius of a set of matrices
• The boundedness of all products of a pair of matrices is undecidable
• Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture
• Title not available (Why is that?)
• An Elementary Counterexample to the Finiteness Conjecture
• An explicit counterexample to the Lagarias-Wang finiteness conjecture
• Ergodic optimization
• Optimal orbits of hyperbolic systems
• The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
• Sets of matrices all infinite products of which converge
• Bounded semigroups of matrices
• Exact computation of joint spectral characteristics of linear operators
• JSR: a toolbox to compute the joint spectral radius
• Ground states are generically a periodic orbit
• Joint spectral radius, Sturmian measures and the finiteness conjecture
• Mather sets for sequences of matrices and applications to the study of joint spectral radii
• Characters of free groups represented in the two-dimensional special linear group.
• On a devil's staircase associated to the joint spectral radii of a family of pairs of matrices
• Balanced complex polytopes and related vector and matrix norms
• Title not available (Why is that?)
• On the Joint Spectral Radius
• Complex Polytope Extremality Results for Families of Matrices
• Duality results for the joint spectral radius and transient behavior
• Primitive words and roots of words
• Title not available (Why is that?)
• Finite dimensional Hilbert spaces are complete for dagger compact closed categories
• Canonical construction of polytope Barabanov norms and antinorms for sets of matrices
• Optimal norms and the computation of joint spectral radius of matrices
• Traces in 2-Generator Subgroups of SL(2, C )
• Prevalent uniqueness in ergodic optimisation
• The uses of 2 by 2 matrices in combinatorial group theory. A survey
• Polynomial identities and the Cayley-Hamilton theorem
• Linear switched dynamical systems on graphs
• Invariant polytopes of sets of matrices with application to regularity of wavelets and subdivisions
• Decision problems, complexity, traces, and representations
• ERGODIC OPTIMIZATION OF BIRKHOFF AVERAGES AND LYAPUNOV EXPONENTS
• Algorithm 1011: Improved invariant polytope algorithm and applications
• Title not available (Why is that?)
• The Barabanov norm is generically unique, simple, and easily computed

This page was built for publication: Spectrum Maximizing Products Are Not Generically Unique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154945)