Extremal sequences of polynomial complexity

DOI10.1017/S0305004113000157zbMath1326.15031arXiv1201.6236MaRDI QIDQ2845616

Nikita Sidorov, Ian D. Morris, Kevin G. Hare

Publication date: 2 September 2013

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

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

zbMATH Keywords

eigenvectorssingular valuesEigenvalues

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)

Related Items (3)

Growth degree classification for finitely generated semigroups of integer matrices ⋮ The entropy of Lyapunov-optimizing measures of some matrix cocycles ⋮ Lyapunov-maximizing measures for pairs of weighted shift operators

Cites Work

• Explicit construction of a Barabanov norm for a class of positive planar discrete-time linear switched systems
• A rapidly-converging lower bound for the joint spectral radius via multiplicative ergodic theory
• An explicit counterexample to the Lagarias-Wang finiteness conjecture
• Substitutions in dynamics, arithmetics and combinatorics
• Structure of extremal trajectories of discrete linear systems and the finiteness conjecture
• The finiteness conjecture for the generalized spectral radius of a set of matrices
• The generalized spectral radius and extremal norms
• Stability of discrete linear inclusion
• On the finiteness property for rational matrices
• A Combinatorial Application of the Maximal Ergodic Theorem
• Automatic Sequences
• An Elementary Counterexample to the Finiteness Conjecture

This page was built for publication: Extremal sequences of polynomial complexity