Lejeune–Rigo–Rosenfeld conjecture on Arnoux–Rauzy words
Let be an Arnoux–Rauzy infinite word. Its -binomial complexity and subword complexity are functions assigning to each positive integer the number of equivalence classes of factors of that length under, respectively, -binomial equivalence and equality. Lejeune–Rigo–Rosenfeld conjecture. The -binomial complexity of coincides with its subword complexity. This generalizes the corresponding property known for Sturmian words; apart from the Sturmian and eventually constant cases, the Tribonacci word is the principal known example, and the conjecture remains open in general.
References
- Léo Vivion, “New examples of words for which binomial complexities and subword complexity coincide”, arXiv:2509.11172 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.