🔢 mathematics

Eventual sign coherence

This paper proves that the asymptotic sign coherence conjecture holds almost surely for skew-symmetric cluster algebras of arbitrary rank under random mutation, and establishes the conjecture in full generality for many families of quivers through the study of a new class of "brog" quivers.

Original authors: Amanda Burcroff, Scott Neville

Published 2026-05-14

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Amanda Burcroff, Scott Neville

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine a vast, chaotic playground filled with spinning tops. Each top represents a quiver (a directed graph with arrows), and the rules for spinning them are called mutations. When you spin a top, it changes its shape, and the arrows pointing to and from it rearrange themselves in a complex dance.

For a long time, mathematicians knew that if you started with a very specific, perfectly organized top (one with a "principal framing"), the dance would always follow a strict rule: the arrows would eventually sort themselves into neat, orderly groups. This rule is called Sign Coherence. It's like saying, "After a while, every arrow will either point strictly North or strictly South; no more confusing East-West zig-zags."

However, a big question remained: What if you start with a messy, random top? If you spin it randomly over and over again, will it eventually settle into that neat, orderly pattern? In 2019, Gekhtman and Nakanishi guessed that yes, it would, but only if you spun it "generically" (in a sufficiently random and varied way).

The Big Discovery
Authors Amanda Burcroff and Scott Neville have proven that this guess is almost always true.

Here is the simple breakdown of their findings:

1. The "Ice Fork" Analogy

Imagine the playground of all possible shapes your spinning top can take. Most of this playground is covered by a specific type of structure the authors call an "Ice Fork."

Think of an Ice Fork as a special, stable shape that acts like a magnet.
The authors proved that no matter how messy your starting top is, if you spin it randomly enough, you will almost certainly wander into the "Ice Fork" neighborhood.
Once you are in this neighborhood, the rules of the game guarantee that the arrows will quickly sort themselves out. The chaos resolves into order.

2. The "Brog" Quivers

For some specific, tricky types of tops (specifically those with 3 moving parts that are very "abundant" with arrows), the authors invented a new category called "Brog" quivers.

Think of "Brog" as a new color code (Blue, Red, Orange, Green) they painted on the tops.
They showed that even these tricky tops, after just one or two good spins, turn into "Brog" shapes.
Once they are "Brog," they behave just like the Ice Forks: they inevitably become orderly.

3. The "Random Walk" Result

The paper's main theorem is a statistical guarantee. If you pick a random spinning sequence (choosing which part of the top to spin next at random), the probability that your top will never become orderly is zero.

In plain English: If you keep spinning a random top long enough, it is a mathematical certainty that it will eventually become perfectly organized.

What This Means (and Doesn't Mean)

What it proves: The paper confirms that "Sign Coherence" is not just a rare trick for perfect starting points; it is a natural, inevitable outcome of the system's own dynamics for almost every possible scenario.
What it doesn't say: The paper is purely about the math of these spinning tops (combinatorics and algebra). It does not claim this solves problems in physics, biology, or engineering, nor does it predict future uses. It simply explains why the math works the way it does.

The Takeaway
The universe of these mathematical shapes is chaotic, but it has a hidden tendency toward order. If you let the system run its course with enough randomness, it will almost always find a way to align itself perfectly. The authors didn't just guess this; they built a map (using Ice Forks and Brog quivers) showing exactly how the chaos turns into order.

Technical Summary: Eventual Sign Coherence

Problem Statement

The paper addresses the sign coherence phenomenon in cluster algebras, specifically focusing on the behavior of c-vectors (which encode the coefficients of the algebra) under mutation sequences. While sign coherence is a fundamental theorem for cluster algebras with principal coefficients (where the initial c-vectors are standard basis vectors), its status for arbitrary cluster algebras of geometric type remained an open question.

In 2019, Gekhtman and Nakanishi proposed the Asymptotic Sign Coherence Conjecture, positing that for any sufficiently generic infinite mutation sequence of a quiver (with arbitrary initial c-vectors), the sequence of c-vectors eventually becomes sign-coherent (i.e., for each mutable vertex, the entries of its c-vector are either all non-negative or all non-positive). The authors aim to prove this conjecture for a broad class of quivers using purely combinatorial methods, avoiding the heavy machinery of representation theory and algebraic geometry typically required for sign coherence proofs.

Methodology

The authors employ a combinatorial approach centered on the structure of the mutation graph (the graph of all mutation-equivalent quivers). Their methodology involves three primary technical innovations:

Ice Forks: The authors extend Warkentin's concept of "forks" (a specific class of abundant, non-acyclic quivers that form the backbone of mutation-infinite mutation graphs) to quivers with frozen vertices, termed ice forks. They prove that ice forks possess strong structural properties: they are "close" to being sign-coherent, and mutations that do not occur at the "point of return" preserve sign coherence or increase the number of sign-coherent vertices.
Brog Quivers: To handle cases where ice forks are insufficient (specifically for mutation-finite or specific rank 3 abundant quivers), the authors introduce a new class of quivers called brog quivers. These are quivers where vertices are colored (blue, red, orange, green) according to specific arrow orientation constraints relative to frozen vertices. Brog quivers generalize the properties of ice forks and are shown to become sign-coherent rapidly under specific mutation sequences.
Probabilistic and Structural Analysis: The authors analyze random mutation sequences (specifically weakly balanced and monotone sequences). They leverage Warkentin's results showing that the mutation graph of a mutation-infinite quiver is dominated by infinite trees of forks. By combining this with their analysis of ice forks and brog quivers, they demonstrate that a random walk on the mutation graph almost surely enters a region where sign coherence is inevitable.

Key Contributions and Results

1. Proof of Asymptotic Sign Coherence for Skew-Symmetric Algebras

The paper's main result (Theorem 1.1 and Theorem 4.8) establishes that for any skew-symmetric cluster algebra of arbitrary rank with a mutation-infinite mutable part, the Gekhtman–Nakanishi conjecture holds almost always.

Theorem 4.8: If $Q$ is a quiver with frozen vertices and a mutation-infinite mutable part, and $M = m_1 m_2 \dots$ is a sequence of mutations chosen uniformly at random from the mutable vertices, then with probability 1, the sequence is eventually sign-coherent.
Corollary 4.9: For a principally framed quiver with a mutation-infinite mutable part, the proportion of sign-coherent quivers within distance $d$ of the initial quiver approaches 1 as $d \to \infty$ .

2. Combinatorial Proofs for Specific Families

The authors provide full combinatorial proofs for the conjecture in cases previously requiring algebraic geometry or where only partial results existed:

Rank 2: The paper recovers and provides a combinatorial proof for the sign coherence of rank 2 quivers (Theorem 6.17).
Mutation-Abundant Rank 3 Quivers: Theorem 6.3 proves the conjecture for all mutation-abundant rank 3 quivers (where every weight in every mutation-equivalent quiver is at least 2). This includes all mutation classes of acyclic quivers with at least 2 arrows between every pair of vertices, and all classes containing no acyclic quiver.
Finite Ice-Forkless Part: The paper identifies a class of quivers where all but finitely many mutation-equivalent quivers are ice forks, proving they satisfy the conjecture (Corollary 6.18).

3. Equivalence of Conjectures

The authors formalize the relationship between the original Asymptotic Sign Coherence Conjecture (Gekhtman–Nakanishi) and their Eventual Sign Coherence Conjecture (Conjecture 7.3). They prove these two formulations are equivalent (Proposition 7.4), clarifying that the "asymptotic" nature of the original conjecture (regarding limits over frozen vertex choices) is mathematically equivalent to the "eventual" nature of sign coherence for a fixed quiver with frozen vertices.

Significance

The paper claims significance primarily in shifting the understanding of sign coherence from a property dependent on specific initial conditions (principal framing) to a generic, emergent property of the mutation process itself.

Combinatorial Accessibility: By avoiding the heavy machinery of cluster categories, Donaldson-Thomas theory, and scattering diagrams, the authors provide a purely combinatorial framework for understanding why sign coherence emerges. This makes the phenomenon more accessible to combinatorialists and suggests that the structural properties of the mutation graph (specifically the prevalence of forks) are the driving force behind sign coherence.
Generality: The results apply to "almost all" mutation sequences for arbitrary rank skew-symmetric algebras, significantly broadening the scope beyond the previously known cases of principal coefficients or specific low-rank examples.
New Tools: The introduction of ice forks and brog quivers provides new structural tools for analyzing the long-term behavior of mutation sequences, particularly in the context of frozen vertices.

The authors conclude that sign coherence is not merely a property preserved under mutation in specific settings, but a phenomenon that emerges eventually after almost any sequence of mutations, fundamentally altering the perspective on the stability of c-vectors in cluster algebras.