Some improvements of the S-adic conjecture

DOI10.1016/J.AAM.2011.03.005MaRDI QIDQ651048zbMATH OpenOpenAlexWikidataFDO

Authors Julien Leroy

Publication date 8 December 2011

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aam.2011.03.005

zbMATH Keywords

factor complexity\(S\)-adic conjectureRauzy graphspecial factor

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Combinatorics on words (68R15) Automata sequences (11B85)

Recommendations

• Do the properties of an S-adic representation determine factor complexity?
• The S-adic Pisot conjecture on two letters
• An \(S\)-adic characterization of minimal subshifts with first difference of complexity \(1 \leq p(n+1) - p(n) \leq 2\)
• A combinatorial proof of \(S\)-adicity for sequences with linear complexity
• ON UNIFORMLY RECURRENT MORPHIC SEQUENCES

Cites work

• scientific article; zbMATH DE number 5707089 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 5051582 (Why is no real title available?)
• Automatic Sequences
• Complexity and special factors
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• Conjugacy and episturmian morphisms.
• Initial powers of Sturmian sequences
• Les transformations de Chacon : combinatoire, structure géométrique, lien avec les systèmes de complexité $2n+1$
• Linearly recurrent subshifts have a finite number of non-periodic subshift factors
• On the number of subwords of everywhere growing DTOL languages
• On the numeration system of Ostrowski
• Rank and symbolic complexity
• Représentation géométrique de suites de complexité $2n+1$
• Substitutional dynamical systems, Bratteli diagrams and dimension groups
• Substitutions in dynamics, arithmetics and combinatorics
• Subword complexities of various classes of deterministic developmental languages without interactions
• Uniform tag sequences

Cited in

(13)

• \(S\)-adic sequences: a bridge between dynamics, arithmetic, and geometry
• An \(S\)-adic characterization of minimal subshifts with first difference of complexity \(1 \leq p(n+1) - p(n) \leq 2\)
• S-adic conjecture and Bratteli diagrams
• Rigidity and substitutive dendric words
• The S-adic Pisot conjecture on two letters
• Do the properties of an S-adic representation determine factor complexity?
• Beyond substitutive dynamical systems: \(S\)-adic expansions
• Subword complexity and decomposition of the set of factors
• -adic characterization of minimal ternary dendric shifts
• On sets of indefinitely desubstitutable words
• Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
• Linearly recurrent sequences and \(S\)-adic sequences
• A characterization of words of linear complexity

This page was built for publication: Some improvements of the \(S\)-adic conjecture

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