Do the properties of an S-adic representation determine factor complexity?

MaRDI QIDQ5404286zbMATH OpenFDO

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

linear complexitymorphismfactor complexitysubword complexityuniform recurrence\(S\)-adic conjecture\(S\)-adicity

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Combinatorics on words (68R15)

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

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
• Maximal bifix decoding
• Low complexity subshifts have discrete spectrum
• 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
• Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
• Linearly recurrent sequences and \(S\)-adic sequences
• Graph towers, laminations and their invariant measures

Describes a project that uses

Uses Software

• OEIS

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)