Almost everywhere balanced sequences of complexity 2n + 1
DOI10.2140/MOSCOW.2022.11.287OpenAlexW3133431714MaRDI QIDQ2107735FDOQ2107735
Julien Cassaigne, Julien Leroy, Sébastien Labbé
Publication date: 2 December 2022
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.10093
Recommendations
- A set of sequences of complexity \(2n+1\)
- \(S\)-adic sequences: a bridge between dynamics, arithmetic, and geometry
- Convergence and factor complexity for the Arnoux-Rauzy-Poincaré algorithm
- Uniformly balanced words with linear complexity and prescribed letter frequencies
- On balanced sequences and their critical exponent
Continued fractions and generalizations (11J70) Symbolic dynamics (37B10) Random dynamical systems aspects of multiplicative ergodic theory, Lyapunov exponents (37H15) Combinatorics on words (68R15)
Cites Work
- Diophantine approximation
- Some Monoids of Pisot Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nombres algébriques et substitutions
- Balancedness of Arnoux-Rauzy and Brun Words
- Topological properties of Rauzy fractals
- Représentation géométrique de suites de complexité $2n+1$
- Title not available (Why is that?)
- Beyond substitutive dynamical systems: S-adic expansions
- Substitutions, Rauzy fractals and tilings
- Deviation for interval exchange transformations
- On some symmetric multidimensional continued fraction algorithms
- Title not available (Why is that?)
- Sequences with minimal block growth
- Symbolic Dynamics II. Sturmian Trajectories
- Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
- The quality of the diophantine approximations found by the Jacobi--Perron algorithm and related algorithms
- The three-dimensional Poincaré continued fraction algorithm
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
- Factor complexity
- The Rauzy Gasket
- Symbolic Dynamics
- Acyclic, connected and tree sets
- Multidimensional continued fractions and a Minkowski function
- A convergence exponent for multidimensional continued-fraction algorithms
- Über Fareynetze in n Dimensionen
- Characterization of the moment space corresponding to the Levermore basis
- Thed-Dimensional Gauss Transformation: Strong Convergence and Lyapunov Exponents
- The Three-Dimensional Gauss Algorithm Is Strongly Convergent Almost Everywhere
- Title not available (Why is that?)
- On almost everywhere strong convergence of multi-dimensional continued fraction algorithms
- A set of sequences of complexity \(2n+1\)
- On the second Lyapunov exponent of some multidimensional continued fraction algorithms
- -adic characterization of minimal ternary dendric shifts
- An $S$-adic characterization of minimal subshifts with first difference of complexity $1 \leq p(n+1) - p(n) \leq 2$
Cited In (6)
- Almost everywhere balanced sequences of complexity $2n+1$
- Title not available (Why is that?)
- A set of sequences of complexity \(2n+1\)
- Symbolic coding of linear complexity for generic translations on the torus, using continued fractions
- On a Class of 2-Balanced Sequences
- 2-balanced sequences coding rectangle exchange transformation
This page was built for publication: Almost everywhere balanced sequences of complexity \(2n + 1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107735)
