Symbol ratio minimax sequences in the lexicographic order
From MaRDI portal
(Redirected from Publication:5743892)
Abstract: Consider the space of sequences of k letters ordered lexicographically. We study the set M({alpha}) of all maximal sequences for which the asymptotic proportions {alpha} of the letters are prescribed, where a sequence is said to be maximal if it is at least as great as all of its tails. The infimum of M({alpha}) is called the {alpha}-infimax sequence, or the {alpha}-minimax sequence if the infimum is a minimum. We give an algorithm which yields all infimax sequences, and show that the infimax is not a minimax if and only if it is the {alpha}-infimax for every {alpha} in a simplex of dimension 1 or greater. These results have applications to the theory of rotation sets of beta-shifts and torus homeomorphisms.
Recommendations
Cites work
- A partial order on \(\times 2\)-invariant measures
- Balanced words and majorization
- Birkhoff's contraction coefficient
- Factor complexity
- On theβ-expansions of real numbers
- Renormalization in a class of interval translation maps ofdbranches
- Représentation géométrique de suites de complexité 2n+1
- Structure of three-interval exchange transformations. II: A combinatorial description of the trajectories
- Sturmian Minimal Sets
- Substitutions and interval exchange transformations of rotation class
- Symbolic Dynamics II. Sturmian Trajectories
- Symbolic dynamics of order-preserving orbits
- The Gauss map on a class of interval translation mappings
- The origins of combinatorics on words
This page was built for publication: Symbol ratio minimax sequences in the lexicographic order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743892)