Abstract
Arnoux-Rauzy words are one possible generalization of Sturmian words. They are infinite words with exactly one left special factor and one right special factor of each length, those special factors being extendable with any letter in the alphabet. Sturmian words are exactly binary Arnoux-Rauzy words.
We are interested here in the language of an Arnoux-Rauzy word, not in the word itself. Just as the language of a Sturmian word depends only on the associated slope, or equivalently on its continued fraction expansion, the language of an Arnoux-Rauzy word is defined by the associated directive sequence.
A classical property of Sturmian words is that they are 1-balanced: any two factors u and v of the same length of a given Sturmian word contain almost the same number of occurrences of any given letter, the difference being at most 1. Actually, this turns out to be a characterization of Sturmian words: an aperiodic infinite binary word is Sturmian if and only if it is balanced.
For Arnoux-Rauzy words, the situation is quite different. It was expected however that they would be C-balanced for some constant C (the maximum allowed difference in the number of occurrences), but we proved [1] that it is not the case, constructing an Arnoux-Rauzy word which is not C-balanced for any C. This was further improved in [2], where a large class of such words is given. On the other hand, it is easy to construct 2-balanced infinite words that are not Arnoux-Rauzy.
The question of characterizing Arnoux-Rauzy words with a given balance arises then naturally. We restrict here to 2-balance and a ternary alphabet, but even so it does not seem an easy problem. In [3] we obtained a sufficient condition, as well as a necessary condition, both of the type: the set of prefixes of the directive sequence is in a certain rational language.
We were able to obtain a characterization [4], at the expense of replacing C-balance with a stronger notion, strong C-balance. Also, we proved that the set of prefixes of directive sequences of 2-balanced ternary Arnoux-Rauzy words does not form a rational language. Therefore, a characterization of 2-balanced ternary Arnoux-Rauzy in terms of rational languages only is not possible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cassaigne, J., Ferenczi, S., Zamboni, L.Q.: Imbalances in Arnoux-Rauzy Sequences. Ann. Inst. Fourier (Grenoble) 50, 1265–1276 (2000)
Cassaigne, J., Ferenczi, S., Messaoudi, A.: Weak mixing of Arnoux-Rauzy Sequences. Ann. Inst. Fourier (Grenoble) 58, 1983–2005 (2008)
Berthé, V., Cassaigne, J., Steiner, W.: Balance properties of Arnoux-Rauzy words. Internat. J. Algebra Comput. 23, 689–703 (2013)
Cassaigne, J., Nardi, J.: Étude du 2-équilibre des mots d’Arnoux-Rauzy (in preparation)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cassaigne, J. (2013). Which Arnoux-Rauzy Words Are 2-Balanced?. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds) Combinatorics on Words. Lecture Notes in Computer Science, vol 8079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40579-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-40579-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40578-5
Online ISBN: 978-3-642-40579-2
eBook Packages: Computer ScienceComputer Science (R0)