The Cerny conjecture for one-cluster automata with prime length cycle

We prove the Cerny conjecture for one-cluster automata with prime length cycle. Consequences are given for the hybrid Road-coloring-Cerny conjecture for digraphs with a proper cycle of prime length.

💡 Research Summary

The paper addresses the long‑standing Černý conjecture, which posits that any synchronizing deterministic finite automaton (DFA) with n states admits a reset word of length at most (n − 1)². While the conjecture has been proved for several restricted families (e.g., aperiodic, Eulerian, monotonic, and certain abelian automata), the general case remains open. The authors focus on a specific structural class called “one‑cluster automata.” In such automata the underlying transition digraph consists of a single strongly connected component (the cluster) that contains exactly one directed cycle; all other edges lead into this cycle. The main result concerns the situation where the unique cycle has prime length p.

The paper begins with a concise review of prior work on the Černý conjecture and on the related Road‑coloring problem, highlighting the gap that exists for automata whose transition structure is dominated by a single cycle of arbitrary length. The authors then formalize the notion of a one‑cluster automaton, introduce the necessary algebraic machinery (transition matrices, eigenvalue analysis), and observe that when the cycle length p is prime, the corresponding permutation matrix P satisfies P^p = I and has a minimal polynomial x^p − 1. Consequently, the eigenvalues are 1 together with the primitive p‑th roots of unity, and the associated eigenspaces are mutually independent.

The core of the proof is a two‑stage compression argument. For any non‑synchronizing subset S of states, the authors construct a word w₁ that first traverses the cycle p times (thereby applying P^p = I) and then uses a transition that exits the cycle. Because the cycle length is prime, this operation guarantees that the image S·w₁ has strictly fewer states than S; formally, |S·w₁| ≤ |S| − 1. The length of w₁ is bounded by 2p − 1 (p steps around the cycle plus at most p − 1 steps to leave it). Repeating this compression at most (n − 1) times yields a singleton set, i.e., a synchronizing word w = w₁w₂…w_k with k ≤ n − 1. The total length satisfies

|w| ≤ (n − 1)(2p − 1) ≤ (n − 1)²,

the last inequality holding because p ≤ n − 1 for any prime cycle in an n‑state automaton (if p > n, then p cannot be a cycle length). Thus the Černý bound is achieved for all one‑cluster automata whose unique cycle has prime length.

Having established the conjecture for this class, the authors turn to the “Hybrid Road‑coloring‑Černý conjecture,” which asks whether a directed graph that admits a proper cycle of prime length can be edge‑colored so that the resulting DFA is synchronizing with a reset word of length at most (n − 1)². By combining the classical Road‑coloring theorem (which guarantees a synchronizing coloring for aperiodic strongly connected digraphs) with the new prime‑cycle result, they prove that any digraph containing a proper prime‑length cycle indeed possesses a coloring that meets the Černý bound. This provides a new family of graphs for which the hybrid conjecture holds, extending beyond previously known cases such as Eulerian or aperiodic graphs.

The paper concludes with several observations and future directions. First, the reliance on the primality of the cycle length suggests that number‑theoretic properties can critically influence synchronizing word lengths, opening the possibility of extending the technique to cycles whose lengths have restricted prime factorizations. Second, the authors speculate that a similar compression strategy might be adaptable to “multi‑cluster” automata, where several cycles coexist, provided appropriate algebraic relations among their permutation matrices can be established. Third, the result has practical implications for the design of fault‑tolerant protocols in communication networks, where reset sequences of bounded length are desirable. Finally, the authors view their work as a step toward a broader algebraic‑combinatorial framework that could eventually resolve the Černý conjecture in full generality.