Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.01577

A proof of Rauzy's conjecture on abelian complexity

Mélodie Andrieu·Léo Vivion
View original source ↗Read source document ↗Export metadata ↓

Abstract

We resolve a conjecture posed by Rauzy in 1983 concerning the $d$-ary generalizations of Sturmian words. A classical theorem by Coven and Hedlund from 1973 states that Sturmian words, which are classically defined by their subword complexity (a combinatorial refinement of topological entropy), or as the natural codings of irrational rotations on the circle, are also characterized by their abelian complexity (a combinatorial refinement of the notion of discrepancy). More precisely, Sturmian words are exactly the binary infinite words with rationally independent letter frequencies and minimal abelian complexity, which is in this case constant and equal to $2$. We prove that there exist no infinite ternary words with rationally independent letter frequencies and constant abelian complexity equal to $3$, thereby establishing Rauzy's conjecture.

Explore related subjects

math.COmath.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mélodie Andrieu, Léo Vivion. 2026-07-27. A proof of Rauzy's conjecture on abelian complexity. https://arxiv.org/abs/2605.01577

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗