Search arXiv⌕ Search

arXiv · 2610.03612

Signed seeds and G-gradings on cluster algebras

Abstract

The theory of cluster algebras is closely connected to the theory of total positivity; indeed, the desire to better understand total positivity was one of the main motivations for Fomin and Zelevinsky's introduction of cluster algebras [arXiv:math/0104151]. In particular, any cluster variety whose coordinate ring has a cluster structure has a natural notion of positive part: the subset of the variety where all cluster variables are positive. In this paper, we explain that there are other signed cells contained in cluster varieties that are equally natural from a cluster-theoretic point of view. These come from signed seeds, which can be thought of as a $\mathbb{Z}/2\mathbb{Z}$-grading on cluster variables, and which were introduced in [arXiv:2310.17727] in the context of the amplituhedron. More generally, given any abelian group $G$, we introduce the notion of a $G$-graded seed for a cluster algebra, which is a way of assigning elements of $G$ to each cluster variable which is compatible with the cluster structure. When $G$ is the multiplicative group $\{-1, 1\}$, this recovers the above notion of signed seed; when $G = \mathbb{C}^*$, this recovers the notion of cluster automorphism group [GSV10] or cluster dilation group [arXiv:2603.17890]; and when $G = \mathbb{Z}^d$, this recovers the notion of graded cluster algebra studied by Grabowski-Launois [arXiv:1301.2133], Grabowski [arXiv:1309.6170] and Gekhtman-Shapiro-Vainshtein [GSV10, Section 5.2] (which had previously appeared in special cases in work of Fomin-Zelevinsky [arXiv:math/0602259]). The examples we study include the space of square matrices, symmetric matrices, skew-symmetric matrices, positroid varieties, and amplituhedron tiles. We also connect this notion to tropical mutation when $G = \mathbb{R}$ or $\mathbb{Z}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lauren Williams, Alan Yan. 2026-10-02. Signed seeds and G-gradings on cluster algebras. https://arxiv.org/abs/2610.03612

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

KEEP EXPLORING

Related papers

Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening

We present new methods and results for constructing optimal Kobon triangle arrangements. First, we introduce a compact table notation for describing arrangements of pseudolines, enabling the representation and analysis of complex cases, including symmetrical arrangements, arrangements with parallel lines, and arrangements with multiple-line intersection points. Building on this, we provide a simple heuristic method and tools for recovering straight-line arrangements from a given table, with the ability to enforce additional properties such as symmetries. The tool successfully recovers arrangements for many previously known optimal solutions. Additionally, we develop a tool that transforms the search for optimal Kobon arrangement tables into a SAT problem, allowing us to leverage modern SAT solvers (specifically Kissat) to efficiently find new solutions or to show that no other solutions exist (for example, confirming that no simple perfect arrangement with 33 triangles exists in the 11-line case). Using these techniques, we find new optimal Kobon arrangements for 23 and 27 lines, along with several other new results.

math.CO↗

Marked multi-colorings and marked chromatic polynomials of hypergraphs and subspace arrangements

We introduce the concepts of marked multi-colorings, marked chromatic polynomials, and marked (multivariate) independence series for hypergraphs. We show that the coefficients of the q-th power of the marked independence series of a hypergraph coincide with its marked chromatic polynomials in q, thereby generalizing a corresponding result for graphs established in Chaithra et al. 2025 (arXiv:2503.11230). These notions are then naturally extended to subspace arrangements. In particular, we prove that the number of marked multi q-colorings of a subspace arrangement is a polynomial in q. We also define the (marked) independence series for subspace arrangements and prove that the (-q)-th power of the independence series of a hyperplane arrangement has non-negative coefficients. We further investigate the coefficientwise non-negativity of the (-q)-th power of the independence series of a hypergraph. We show that all edges must have even cardinality for this non-negativity to hold, and provide a counterexample demonstrating that this condition is not sufficient.

math.CO↗

Robust ladders in the HLM tower construction for arithmetic regularity over ${\bf F}_2^{\,n}$

Green's arithmetic regularity lemma over ${\bf F}_2^n$ has tower-type lower bounds. We show that the large order properties in the Hosseini--Lovett--Moshkovitz--Shapira (HLM) construction survive sparse edits. If $d$ is the top block dimension, then changing at most $|G|/16$ points of the top HLM set $A_s$ still leaves a half-graph of height $d/8$. For a suitable choice of the HLM maps, changing at most $ε|G|$ points of a super-level set of the averaged witness still leaves a half-graph of height $d/(8\sqrt{s})\ge {\rm twr}(s-2)$. The proofs use the binary code formed by the top-level row traces and Sauer's lemma.

math.CO↗