Frequencies of factors in Arnoux–Rauzy sequences (Q4522901)

Arnoux-Rauzy sequences [see \textit{P. Arnoux} and \textit{G. Rauzy}, Bull. Soc. Math. Fr. 119, 199-215 (1991; Zbl 0789.28011)] are sequences with block-complexity \(2n+1\) satisfying an extra combinatorial condition. The authors call Arnoux-Rauzy sequences on a \(k\)-letter alphabet, sequences with complexity \((k-1)n+1\) that satisfy a similar combinatorial condition. In particular these sequences are the original Arnoux-Rauzy sequences for \(k=3\), and they are the classical Sturmian (billiard) sequences for \(k=2\). In the paper under review the authors study the frequencies of the factors (blocks) occurring in these sequences, thus generalizing a result of \textit{V. Berthé} for Sturmian sequences [see Theor. Comput. Sci. 165, 295-309 (1996; Zbl 0872.11018)]. The methods involve nice number-theoretic and combinatorial results. Note that Ref. [13] has appeared [\textit{X. Droubay, J. Justin} and \textit{G. Pirillo}, Theory. Comput. Sci. 255, No. 1-2, 539-553 (2001; Zbl 0981.68126)]. Also note that Reference [15] can be replaced by \textit{S. Ferenczi, C. Holton} and \textit{L. Q. Zamboni}, Structure of three interval exchange transformations. I: An arithmetic study, Ann. Inst. Fourier 51, No. 4, 861-901 (2001; Zbl 1029.11036).