




















A celebrated theorem by Coven and Hedlund (1973) states that Sturmian words are characterized by their abelian complexity: they are precisely the infinite words with rationally independent letter frequencies and constant abelian complexity equal to 2. In this article, we prove a conjecture of Rauzy (1983), showing that there do not exist infinite ternary words with rationally independent letter frequencies and constant abelian complexity equal to 3.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。