Search arXivSearch

arXiv · 2606.27523

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

Abstract

For an acyclic cluster algebra, the $c$-vectors are, up to sign, the real Schur roots of the associated root system. We study the two-coordinate projections $(c_v, c_w)$ of this configuration: when the difference $c_v - c_w$ is bounded, the image lies in a finite band of lattice lines, and we ask when the projection fills every lattice point of that band. In affine type, boundedness is equivalent to $δ_v=δ_w$ for the null root $δ$. Writing this common coordinate as $r$, we prove that a band line fills exactly when its transjective root classes cover every residue modulo $r$. This yields a complete classification for every acyclic orientation of every simply-laced affine diagram. For a source-sink $\widetilde A_n$ quiver, every projection fills except the source-sink diagonal. In tree type, every width-one band fills, while every width-two band fails on its two boundary lines because of a congruence gap. The Auslander--Reiten defect further determines whether such a boundary line is finite or contains an infinite arithmetic progression; finiteness is governed by a balanced-geodesic criterion. On the annulus, the absolute defect is the crossing number with the core curve, and the $δ$-shift is the Dehn twist along it.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sarah B. Brodsky. 2026-08-11. Coordinate projections of $c$-vectors of cluster algebras from the annulus. https://arxiv.org/abs/2606.27523

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO