Balancedness of Arnoux-Rauzy and Brun words
classification
💻 cs.FL
math.DS
keywords
wordsbrunarnoux-rauzybalancednesslettersalgorithmsalmostalphabets
read the original abstract
We study balancedness properties of words given by the Arnoux-Rauzy and Brun multi-dimensional continued fraction algorithms. We show that almost all Brun words on 3 letters and Arnoux-Rauzy words over arbitrary alphabets are finitely balanced; in particular, boundedness of the strong partial quotients implies balancedness. On the other hand, we provide examples of unbalanced Brun words on 3 letters.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.