🔢 mathematics

Coordinate projections of $c$ -vectors of cluster algebras from the annulus

This paper investigates the coordinate projections of $c$ -vectors in acyclic cluster algebras, establishing a dichotomy for bounded differences and demonstrating that while most projections in affine type $\widetilde{A}_n$ (the annulus) fill their associated bands, specific diagonal pairs fail to do so due to the Auslander–Reiten defect, with similar non-filling phenomena also occurring in type $\widetilde{E}_7$ .

Original authors: Sarah B. Brodsky

Published 2026-06-29

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Sarah B. Brodsky

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, infinite grid made of integer points (like a giant sheet of graph paper). In the world of mathematics known as Cluster Algebras, there is a special collection of points on this grid called c-vectors. These points aren't random; they follow strict rules based on the shape of a network (a "quiver") that defines the algebra.

This paper by Sarah B. Brodsky is like a detective story investigating what happens when we squint at this giant grid and only look at two coordinates at a time (for example, just looking at the X and Y positions, ignoring everything else).

Here is the story of what the paper discovers, explained through simple analogies:

1. The "Band" of Possibility

When you pick two specific spots on the network (let's call them Vertex V and Vertex W) and look at the difference between their coordinates in the c-vector grid, something interesting happens.

The Rule: Sometimes, the difference between these two numbers stays within a fixed limit. Imagine a highway with a strict speed limit. No matter how far you drive, you never go faster than 60 mph.
The Band: If the difference is bounded, all the points you see when you project them onto your two-spot view fall into a "band" of parallel lines. It's like a striped ribbon running across the grid.
The Big Question: Does this ribbon get filled with points? Or are there empty gaps in the stripes?

2. The "Annulus" (The Donut)

The paper focuses heavily on a specific shape called the Annulus (a donut shape). In this shape, the network is a simple loop (a cycle) with one special "Source" (where everything starts) and one special "Sink" (where everything ends).

The paper proves a surprising fact about this donut shape:

Most Pairs are Perfect: If you pick any two spots on the donut to look at, the resulting "striped ribbon" is completely filled with points. Every single integer spot on the stripe is occupied.
The One Exception: There is exactly one pair of spots that breaks the rule: the Source and the Sink.
- When you look at the Source and the Sink together, the "stripe" in the middle (where the difference is zero) is empty in the middle. It only has a few points at the very ends, but the middle is a gap.
- Why? The paper explains that this gap is caused by a hidden mathematical "defect" (a measure of imbalance). The Source and Sink are the only pair that perfectly measures this defect. When the defect is zero (the middle of the stripe), the points that usually fill the gap simply don't exist there; they only exist in a tiny, finite cluster.

3. The "Defect" as a Hidden Compass

The paper introduces a concept called the Auslander–Reiten defect. Think of this as a hidden compass that tells you if a point belongs to a "regular" group or an "exceptional" group.

In the donut shape, this compass happens to align perfectly with the line connecting the Source and the Sink.
Because of this alignment, the Source-Sink pair is the only one that "sees" the empty gap in the middle of the ribbon.
For all other pairs of spots, the compass is tilted, so they don't see the gap; they see a fully filled ribbon.

4. Beyond the Donut: The "E7" Surprise

The authors didn't stop at the donut. They asked: "Does this empty-gap problem happen in other shapes?"

Tree Shapes: In shapes that look like trees (branching out without loops), the paper proves that if the "weight" of the spots is low (coefficient 1), the ribbons are always filled, unless you are looking at the Source-Sink pair of a donut.
The E7 Surprise: However, they found a weird exception in a complex shape called $\tilde{E}_7$ .
- Here, the "gap" isn't in the middle (the defect zero line). Instead, the gap is on the outer edges of the ribbon.
- Imagine a ribbon that is supposed to be 5 stripes wide. In most cases, all 5 stripes are filled. In this specific $\tilde{E}_7$ case, the middle 3 stripes are filled, but the two outermost stripes are empty.
- This happens because a special group of "regular" points reaches the outer edges, but the "transjective" points (the ones that usually fill the rest) stop short.

Summary of the Findings

The General Rule: For most pairs of spots in these mathematical networks, the projected view is a perfectly filled band of points.
The Donut Exception: In the donut shape, the pair connecting the Start (Source) and End (Sink) leaves a hole in the middle of the band. This is the only time the "defect" is visible as a coordinate difference.
The E7 Exception: In a specific complex shape ( $\tilde{E}_7$ ), there is a pair of spots where the edges of the band are empty, not the middle.
The Conclusion: The paper classifies exactly when these gaps happen. It turns out that for simple cases, the only gap is the Source-Sink hole in the donut. For more complex cases, gaps can happen at the edges, but this is very rare (only found in $\tilde{E}_7$ so far).

In a nutshell: The paper maps out where the "holes" are in these mathematical projections. It finds that usually, the picture is solid, but if you look at the Start and End of a loop, or a very specific complex shape, you'll find a missing piece of the puzzle.

Technical Summary: Coordinate Projections of c-Vectors of Cluster Algebras from the Annulus

Problem Statement
This paper investigates the coordinate projections of the set of $c$ -vectors, $C(Q)$ , associated with an acyclic cluster algebra $A(Q)$ . By sign-coherence and the work of Nájera Chávez, $C(Q)$ corresponds to the set of signed real Schur roots of the underlying quiver $Q$ . For a pair of vertices $(v, w)$ , the study focuses on the projection $\pi_{vw}: C(Q) \to \mathbb{Z}^2$ , specifically examining the image's behavior when the coordinate difference $c_v - c_w$ is bounded.

The central questions are:

Band Existence: For which pairs $(v, w)$ is the difference $c_v - c_w$ bounded over $C(Q)$ ?
Projection Filling: When the difference is bounded, does the projection $\pi_{vw}(C(Q))$ surject onto the entire "band" of lattice lines defined by $|x - y| \leq b_{vw}$ , or are there gaps?

Methodology
The author employs the representation theory of tame hereditary algebras and the combinatorics of affine root systems. Key methodological tools include:

Root System Decomposition: Utilizing the classification of roots in affine types into real roots of the form $\alpha + m\delta$ (where $\delta$ is the null root) and distinguishing between preprojective, regular, and preinjective components.
The Defect Form: Analyzing the Auslander–Reiten defect $\partial$ , a linear form that separates transjective (preprojective and preinjective) modules from regular modules. The paper establishes a direct link between the defect and coordinate differences.
Transjective vs. Regular Roots: Leveraging the fact that transjective roots generate infinite families via $\delta$ -shifts (filling lines), whereas regular roots form a finite set.
Computational Verification: For specific exceptional types, the paper utilizes independent computational methods (root-theoretic generation via Coxeter transformations and seed mutation) to classify non-filling pairs.

Key Contributions and Results

1. Band-Existence Dichotomy (Theorem 1.1)
The paper establishes a uniform criterion for boundedness across all acyclic types. For an affine quiver with null root $\delta$ , the difference $c_v - c_w$ is bounded if and only if $\delta_v = \delta_w$ . In this case, the bound $b_{vw}$ is determined by the maximum difference over the underlying finite root system. If $\delta_v \neq \delta_w$ , the difference is unbounded due to the infinite nature of transjective components.

2. The Annulus Case ( $\tilde{A}_n$ ) and Source-Sink Orientation
For the cluster algebra of the annulus (type $\tilde{A}_n$ ) with a source-sink orientation (unique source $s$ , unique sink $t$ ), the paper provides a complete resolution of the filling question (Theorem 1.2):

Every coordinate difference is bounded by 1.
For any pair $(v, w) \neq (s, t)$ , the projection fills the entire band $\{|c_v - c_w| \leq 1\}$ .
For the source-sink pair $(s, t)$ , the projection fills the off-diagonal lines ( $c_s - c_t = \pm 1$ ) but fails to fill the diagonal ( $c_s = c_t$ ). The diagonal contains only the finite set of regular real Schur roots.

3. The Defect as the Universal Obstruction
The paper identifies the Auslander–Reiten defect as the intrinsic obstruction to filling.

A band line is filled if and only if it contains a transjective root.
The diagonal fails to fill if and only if the defect form $\partial$ coincides with the coordinate difference $x_v - x_w$ .
In type $\tilde{A}_n$ , the defect is exactly $x_s - x_t$ , explaining the unique non-filling diagonal for the source-sink pair.
In other affine types (e.g., $\tilde{D}_4$ ), the defect is not a coordinate difference; consequently, all coordinate projections fill their bands, even though the defect remains a non-trivial invariant.

4. Classification of Non-Filling Pairs in Higher Coefficients
The study extends beyond coefficient 1 (where $\delta_v = \delta_w = 1$ ) to pairs with higher coefficients.

Coefficient 1: Theorem 8.7 proves that the only non-filling pair in any affine type with coefficient 1 is the source-sink pair of $\tilde{A}_n$ .
Coefficient $\geq 2$ : Non-filling can occur at the "boundary" of the band (lines where $|c_v - c_w| > 1$ ) if regular roots extend the band beyond the reach of transjective roots.
Computational Classification: A computer-assisted classification for types $\tilde{A}_{p,q}$ $\tilde{A}_{p, q}$ , $\tilde{D}_n$ $\tilde{D}_{n}$ , $\tilde{E}_6, \tilde{E}_7, \tilde{E}_8$ $\tilde{E}_{6}, \tilde{E}_{7}, \tilde{E}_{8}$ reveals that:
- The only non-filling pairs are the source-sink diagonals in $\tilde{A}_{p,q}$ .
- There is exactly one off-diagonal non-filling pair in type $\tilde{E}_7$ (vertices with coefficient 2), where the regular roots reach difference $\pm 2$ while transjective roots are limited to $\pm 1$ .
- All other tested types ( $\tilde{D}_n, \tilde{E}_6, \tilde{E}_8$ ) fill completely.

Significance and Claims
The paper claims that the combinatorial question of projection surjectivity serves as a detector for the homological invariant known as the defect.

Topological Interpretation: In the annulus model, the defect corresponds to the signed crossing number of arcs against the core curve. The non-filling diagonal represents the locus of arcs that do not cross the core (regular modules), while the filled lines represent arcs crossing the core (transjective modules).
Universality: The result demonstrates that while the defect is always the obstruction to filling, it is only "visible" to coordinate projections in specific orientations (like the source-sink orientation of $\tilde{A}_n$ ). In other types, the obstruction exists but is not isolated by a single coordinate difference.
Open Problems: The paper explicitly states that a complete classification of non-filling pairs for all affine types remains open, particularly for pairs with coefficient $\geq 2$ beyond the computed range. It conjectures that non-filling occurs precisely when the "regular reach" of the band exceeds the "transjective reach," but a general formula for these reaches based on tube ranks is not provided.

The work does not propose new applications or experimental proposals but rather refines the understanding of the geometric and homological structure of cluster algebras through the lens of coordinate projections.

1. The "Band" of Possibility

2. The "Annulus" (The Donut)

3. The "Defect" as a Hidden Compass

4. Beyond the Donut: The "E7" Surprise

Summary of the Findings

More like this