Convergence and factor complexity for the Arnoux-Rauzy-Poincaré algorithm

DOI10.1007/978-3-642-40579-2_10MaRDI QIDQ2849978zbMATH OpenOpenAlexFDO

Authors Valérie Berthé, Sébastien Labbé

Publication date 20 September 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40579-2_10

Mathematics Subject Classification ID

Continued fractions (11A55) Number-theoretic algorithms; complexity (11Y16) Combinatorics on words (68R15)

Recommendations

• Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
• Balancedness of Arnoux-Rauzy and Brun words
• S-adic sequences: a bridge between dynamics, arithmetic, and geometry
• S-adic expansions related to continued fractions
• On some symmetric multidimensional continued fraction algorithms

Cited in

(4)

• Almost everywhere balanced sequences of complexity \(2n + 1\)
• On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm
• Bispecial factors in the Brun S-adic system
• Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm

This page was built for publication: Convergence and factor complexity for the Arnoux-Rauzy-Poincaré algorithm

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