Some improvements of the S-adic conjecture
From MaRDI portal
Publication:651048
DOI10.1016/J.AAM.2011.03.005zbMATH Open1247.37012OpenAlexW2153295092WikidataQ122875138 ScholiaQ122875138MaRDI QIDQ651048FDOQ651048
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
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
- Title not available (Why is that?)
- Automatic Sequences
- Uniform tag sequences
- Title not available (Why is that?)
- Représentation géométrique de suites de complexité $2n+1$
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- Substitutions in dynamics, arithmetics and combinatorics
- Initial powers of Sturmian sequences
- Complexity and special factors
- Subword complexities of various classes of deterministic developmental languages without interactions
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- On the numeration system of Ostrowski
- Conjugacy and episturmian morphisms.
- Title not available (Why is that?)
- Rank and symbolic complexity
- Les transformations de Chacon : combinatoire, structure géométrique, lien avec les systèmes de complexité $2n+1$
- On the number of subwords of everywhere growing DTOL languages
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
- Linearly recurrent sequences and \(S\)-adic sequences
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
- 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)
