Do the properties of an S-adic representation determine factor complexity?
From MaRDI portal
Publication:5404286
zbMATH Open1354.68214MaRDI QIDQ5404286FDOQ5404286
Authors: Fabien Durand, Julien Leroy, Gwénaël Richomme 
Publication date: 24 March 2014
Full work available at URL: http://www.emis.de/journals/JIS/VOL16/Durand/durand2.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Some improvements of the \(S\)-adic conjecture
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
- A combinatorial proof of \(S\)-adicity for sequences with linear complexity
- Beyond substitutive dynamical systems: \(S\)-adic expansions
- Linearly recurrent sequences and \(S\)-adic sequences
linear complexitymorphismfactor complexitysubword complexityuniform recurrence\(S\)-adic conjecture\(S\)-adicity
Cited In (18)
- \(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\)
- Spectral properties of Schrödinger operators associated with almost minimal substitution systems
- Rigidity and substitutive dendric words
- The \(S\)-adic Pisot conjecture on two letters
- Some improvements of the \(S\)-adic conjecture
- Low complexity subshifts have discrete spectrum
- Maximal bifix decoding
- Geometry, dynamics, and arithmetic of $S$-adic shifts
- Sommes de Birkhoff itérées sur des extensions finies d'odomètres. Construction de solutions auto-similaires à des équations différentielles avec délai
- Torsion-free $S$-adic shifts and their spectrum
- Tower power for \(S\)-adics
- Eventually dendric shift spaces
- Symbolic coding of linear complexity for generic translations on the torus, using continued fractions
- -adic characterization of minimal ternary dendric shifts
- Linearly recurrent sequences and \(S\)-adic sequences
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
- Graph towers, laminations and their invariant measures
Uses Software
This page was built for publication: Do the properties of an \(S\)-adic representation determine factor complexity?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404286)
