Powers in a class of A-strict standard episturmian words

This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent results of Damanik and Lenz (2003), who studied powers in Sturmian words. The key tools in our analysis are canonical decompositions and a generalization of singular words, which were originally defined for the ubiquitous Fibonacci word. Our main results are demonstrated via some examples, including the $k$-bonacci word: a generalization of the Fibonacci word to a $k$-letter alphabet ($k\geq2$).

💡 Research Summary

This paper investigates the occurrence of integer powers in a distinguished family of infinite words known as A‑strict standard episturmian words. Episturmian words generalize Sturmian sequences to arbitrary finite alphabets, and the A‑strict subclass is characterized by the property that every letter of the alphabet appears infinitely often and that the construction proceeds by repeatedly inserting a new letter together with the reversal of the current prefix. The authors focus on those episturmian words whose directive sequences mimic the alternating pattern of characteristic Sturmian words (e.g., 0 1 0 1 …).

The central technical tool is the canonical decomposition of an episturmian word: at the n‑th stage the finite prefix sₙ is obtained from sₙ₋₁ by concatenating sₙ₋₁, a new letter aₙ, and the reversal of sₙ₋₁. Within this framework the authors introduce a generalized notion of singular words, extending the classical singular word defined for the Fibonacci word. A singular word σₙ is the minimal block that bridges sₙ₋₁ and aₙ in the construction; its length and position can be expressed explicitly in terms of the recurrence governing the directive sequence.

Building on the earlier work of Damanik and Lenz (2003), who classified all powers in binary Sturmian words, the paper shows how to adapt and extend those ideas to the multi‑letter setting. The key insight is that any occurrence of a power wᵖ (p ≥ 2) in an A‑strict standard episturmian word must be built from singular words. More precisely, the authors prove that w must be either a single singular word σₙ or a concatenation of consecutive singular words σₙσₙ₊₁…σₙ₊ₘ. Moreover, the exponent p is bounded by the maximal number of consecutive repetitions of that block allowed by the combinatorial structure of the word.

The main theorem provides an exhaustive list of all possible integer powers:

1. Powers of a single singular word σₙ, where the exponent equals the number of times σₙ appears consecutively in the infinite word.
2. Powers of a block formed by a finite sequence of consecutive singular words, with the exponent again determined by the maximal consecutive repetition of that block.

The proof proceeds by induction on the construction stages, using return‑word analysis and careful control of overlaps between copies of candidate blocks. By showing that the set of return words at each stage is finite and highly constrained, the authors eliminate all configurations that could yield a power not of the prescribed form.

To illustrate the abstract results, the paper treats the k‑bonacci words as a concrete family. For an alphabet of size k ≥ 2, the directive sequence cycles through the k letters, producing a word whose finite prefixes have lengths given by the k‑bonacci numbers Fₙ(k). In this case the singular words coincide with the prefixes of length Fₙ(k), and the theorem predicts that any power must be a repetition of such a prefix. The authors compute explicit bounds on the admissible exponents (e.g., for the binary Fibonacci word the maximal exponent is 3, for the ternary Tribonacci word it is 4, etc.) and verify the predictions by direct enumeration.

Beyond the specific examples, the results have broader implications for symbolic dynamics and combinatorics on words. The classification of powers in A‑strict standard episturmian words shows that despite the increased alphabet size, the combinatorial complexity remains tightly controlled: the subword complexity is minimal (n + 1), and the power structure mirrors that of Sturmian sequences. This contributes to a deeper understanding of how low complexity and strictness interact to restrict repetition phenomena.

Finally, the paper discusses possible extensions. One direction is to relax the A‑strict condition and study powers in more general episturmian words, where the directive sequence may contain arbitrary repetitions of letters. Another is to explore algorithmic applications: the canonical decomposition and singular‑word framework yield an efficient method for detecting powers in large texts generated by episturmian morphisms. The authors suggest that similar techniques could be applied to study other regularities such as palindromic richness or balance properties in multi‑letter low‑complexity sequences.