Factor complexity of S-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
From MaRDI portal
Publication:477772
DOI10.1016/J.AAM.2014.11.001zbMATH Open1310.68170arXiv1404.4189OpenAlexW3101218601MaRDI QIDQ477772FDOQ477772
Authors: Valérie Berthé, Sébastien Labbé 
Publication date: 9 December 2014
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Abstract: The Arnoux-Rauzy-Poincar'e multidimensional continued fraction algorithm is obtained by combining the Arnoux-Rauzy and Poincar'e algorithms. It is a generalized Euclidean algorithm. Its three-dimensional linear version consists in subtracting the sum of the two smallest entries to the largest if possible (Arnoux-Rauzy step), and otherwise, in subtracting the smallest entry to the median and the median to the largest (the Poincar'e step), and by performing when possible Arnoux-Rauzy steps in priority. After renormalization it provides a piecewise fractional map of the standard -simplex. We study here the factor complexity of its associated symbolic dynamical system, defined as an -adic system. It is made of infinite words generated by the composition of sequences of finitely many substitutions, together with some restrictions concerning the allowed sequences of substitutions expressed in terms of a regular language. Here, the substitutions are provided by the matrices of the linear version of the algorithm. We give an upper bound for the linear growth of the factor complexity. We then deduce the convergence of the associated algorithm by unique ergodicity.
Full work available at URL: https://arxiv.org/abs/1404.4189
Recommendations
- Convergence and factor complexity for the Arnoux-Rauzy-Poincaré algorithm
- \(S\)-adic sequences: a bridge between dynamics, arithmetic, and geometry
- \(S\)-adic expansions related to continued fractions
- A combinatorial proof of \(S\)-adicity for sequences with linear complexity
- On the number of Arnoux-Rauzy words
multidimensional continued fractionssubstitutionsfactor complexity\(S\)-adic wordsArnoux-Rauzy wordsPoincaré algorithm
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Balancedness of Arnoux-Rauzy and Brun Words
- Représentation géométrique de suites de complexité $2n+1$
- Beyond substitutive dynamical systems: S-adic expansions
- Title not available (Why is that?)
- Some improvements of the \(S\)-adic conjecture
- Substitutions in dynamics, arithmetics and combinatorics
- Deviation for interval exchange transformations
- Complexity and special factors
- Title not available (Why is that?)
- A unique ergodicity of minimal symbolic flows with linear block growth
- Billiard complexity in rational polyhedra
- Complexity of trajectories in rectangular billiards
- Discrete linear objects in dimension n: the standard model
- Bispecial factors in circular non-pushy D0L languages
- Balances for fixed points of primitive substitutions.
- The three-dimensional Poincaré continued fraction algorithm
- Uniformly balanced words with linear complexity and prescribed letter frequencies
- Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm
- Sequences with minimal block growth II
- Minimal symbolic flows having minimal block growth
- Rank and symbolic complexity
- Factor complexity
- Infinite words with uniform frequencies, and invariant measures
Cited In (13)
- Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property
- Linear-fractional invariance of the simplex-module algorithm for expanding algebraic numbers in multidimensional continued fractions
- A local algorithm for constructing derived tilings of the two-dimensional torus
- Periodic karyon expansions of algebraic units in multidimensional continued fractions
- Localized Pisot matrices and joint approximations of algebraic numbers
- Simplex-karyon algorithm of multidimensional continued fraction expansion
- The karyon algorithm for expansion in multidimensional continued fractions
- S-adic Sequences: A Bridge Between Dynamics, Arithmetic, and Geometry
- Almost everywhere balanced sequences of complexity \(2n + 1\)
- Linear-fractional invariance of multidimensional continued fractions
- The best approximation of algebraic numbers by multidimensional continued fractions
- On some symmetric multidimensional continued fraction algorithms
- Bispecial Factors in the Brun S-Adic System
This page was built for publication: Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477772)
