Abelian periods of factors of Sturmian words (Q2187128)

Recall that a word \(w := w_0 w_1 \ldots w_{|w|-1}\) is said to have period \(p\) if \(w_i = w_{i+p}\) for all \(i\) with \(0 \leq i\leq |w|-1-p\). This is equivalent to saying that \(w\) is a prefix of a power of some word \(z\) of length \(p\). This notion can be generalized to an abelian framework, namely \(m\) is called an abelian period of \(w\) if \(w\) is a factor of an abelian power \(u_0 u_1 \ldots u_{n-1}\) with \(|u_0| = \ldots = |u_{n-1}| = m\), where ``abelian power'' means that each word \(u_j\) can be obtained by permuting the letters of \(u_0\). The main result of the paper states: If \(m\) is the minimal abelian period of a nonempty factor of a Sturmian word of slope \(\alpha\) with continued fraction expansion \([0; a_1, a_2, \ldots]\) and convergents \(p_k/q_k\), then either \(m = t q_k\), for some \(k \geq 0\) and some \(t\) such that \(1 \leq t \leq a_{k+1}\) or else \(m = \ell q_k + q_{k-1}\) for some \(k \geq 1\) and some \(\ell\) such that \(1 \leq \ell < a_{k+1}\). This result implies in particular a result described in [\textit{G. Fici} et al., Theor. Comput. Sci. 635, 16--34 (2016; Zbl 1346.68150)], namely: The set of minimal abelian periods of all factors of the binary Fibonacci sequence is the set of Fibonacci numbers. Finally note that results in the arXiv paper [\textit{D. Goč} and \textit{J. Shallit}, ``Least periods of \(k\)-automatic sequences'', Preprint, \url{arXiv:1207.5450}] and more can be found in the paper [\textit{D. Goč} et al., Int. J. Found. Comput. Sci. 24, No. 6, 781--798 (2013; Zbl 1304.68143)].