Gr\"obner Cones for Finite Type Cluster Algebras

Karolyn So; Nathan Ilten

REVIEW 2 major objections 4 minor 19 references

Gr\"obner Cones for Finite Type Cluster Algebras

T0 review · 2 major / 4 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Compatibility-degree vectors of any cluster variable lie in the Gröbner cone for every finite-type cluster algebra, and the cone is explicitly described in types A_n, B_n, C_n, D_n.

desk verdict A solid, genuinely new description of Gröbner cones for finite type cluster algebras, with a load-bearing but plausibly correct computer check for the exceptional types. read the letter →

arxiv 2501.07065 v1 pith:WKETJ6DZ submitted 2025-01-13 math.AC math.CO

Nathan Ilten , Karolyn So This is my paper · ORCID

classification math.ACmath.CO MSC 13F6013P10

keywords clusteralgebrasGröbnerconescompatibilitydegreefinitetypetermordersinitialidealsassociahedraDynkintypes

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Every cluster algebra of finite cluster type carries two natural ideals: the relation ideal $I_A$ among its cluster and frozen variables, and the monomial ideal $I^\times_A$ generated by products of incompatible cluster variables. The paper proves that for any cluster variable $v$, the weight vector $\omega_v = [(v||y)]_{y \in V \cup W}$ whose entries are compatibility degrees belongs to the Gröbner cone $C_A$ of weights that degenerate $I_A$ to $I^\times_A$. It follows that the sum of all such vectors lies in the interior of $C_A$, producing an explicit circular term order for every finite-type cluster algebra. For types $A_n,B_n,C_n,D_n$, the paper gives complete polyhedral descriptions of $C_A$---bases of the lineality space and generators of the rays---in the models with special frozen variables and in the no-frozen case. It also proves the deformation-theory conjecture that nontrivial first-order embedded deformations of $\operatorname{Spec}(K[z]/I^\times_A)$ cannot have their negative multidegrees in the semigroup coming from primitive exchange relations.

What carries the argument

The load-bearing machinery is the compatibility-degree vector $\omega_v$ together with the dual description of the Gröbner cone: by Lemma 2.2.4, $C_A$ is the dual cone of $C_{\mathrm{prim}}$, the cone generated by degrees $\deg(xx') - \deg(y_1)$ of primitive exchange relations $xx' = y_1 + y_2$. To place $\omega_v$ in $C_A$ it suffices to check that $\omega_v$ has nonnegative dot product with every such degree, and Proposition 4.1.2 proves the stronger balancing statement that left and right sides give the same maximum. In the classical types the geometry of exchange quadrilaterals turns this algebraic check into crossing counts: a cluster variable $v$ corresponds to a diagonal or pair of diagonals, and $\omega_v \cdot \deg(y_i)$ equals the number of crossings between that diagonal and the sides of the quadrilateral encoding the monomial $y_i$ (up to a constant). For the exceptional types the same inequality is checked computationally through the Coxeter-element construction, where cluster variables are weights $c^k\omega_i$ and exchange relations are produced from the two-element set $\{\lambda+\mu, \lambda \uplus_c \mu\}$ associated to exchangeable weights.

What would settle it

Independently recompute, for type $E_8$, the complete list of cluster variables, all compatibility-degree vectors $\omega_v$, and all primitive exchange relations from the Coxeter-element model, then test inequality (4.1.3) for every cluster variable and every primitive relation. Finding one $v$ and one primitive relation where the inequality fails would disprove Theorem 4.1.1; a clean independent pass would convert the asserted computational verification into reproducible evidence.

Watch

Extended reading notes

Core claim

The paper's central claim is Theorem 4.1.1: for any cluster algebra $A$ of finite cluster type, with cluster variables $V$ and frozen variables $W$, and for any $v \in V$, the vector $\omega_v = [(v||y)]_{y \in V \cup W}$ belongs to the Gröbner cone $C_A$ of $I_A$ with respect to $I^\times_A$. The proof of this membership is reduced to Proposition 4.1.2, which asserts that for every primitive exchange relation $xx' = y_1 + y_2$ and every $v \neq x,x'$, the weight $\omega_v$ pairs equally with the left-hand monomial and with the maximum of the two right-hand monomials. In the classical types this equality is proved by translating exchange relations into quadrilaterals in regular polygons, where dot products become crossing counts and the relevant inequality becomes a small geometric lemma about line segments crossing a quadrilateral. In the exceptional types the same equality is verified by a computer calculation, using the Coxeter-element model to compute compatibility degrees and exchange monomials. The paper then upgrades the membership statement into explicit structure theorems: the sum of all $\omega_v$ lies in the interior of $C_A$, and in types $A_n,B_n,C_n,D_n$ the cone's lineality space and rays are described by explicit vectors built from diagonals of the polygon model.

Load-bearing premise

The load-bearing premise is that the computer verification for the exceptional types $E_6,E_7,E_8,F_4,G_2$ is correct; the code is only referenced as an accompanying file, not reproduced in the paper, so if the computation or the reconstruction of exchange relations from $g$-vectors contains an error, Theorem 4.1.1 would fail for those types.

Editorial extensions

If this is right

Every finite-type cluster algebra has at least one explicit circular term order: the weight $\omega = \sum_v \omega_v$ lies in the interior of $C_A$, so the initial ideal of $I_A$ is exactly $I^\times_A$ under a term order constructed directly from compatibility degrees.
For any fixed cluster variable $v$, the weight $\omega_v$ is itself circular, so one can build many distinct degenerations of $I_A$ to $I^\times_A$ by varying the chosen $v$.
In types $A_n,B_n,C_n,D_n$ the Gröbner cone is completely determined: the paper's lists give bases of the lineality space and generators of the rays, both with the special frozen variables and with no frozen variables.
The deformation conjecture, stated as Conjecture 6.2.9 in the earlier deformation-theory paper, is proven: if a first-order embedded deformation of $\operatorname{Spec}(K[z]/I^\times_A)$ is nontrivial, then the negative of its multidegree is not a nonnegative combination of primitive exchange degrees.
The type $A_n$ result recovers the known Gröbner-cone description for the Plücker coordinate ring of the Grassmannian $G(2,n+3)$, placing it as a special case of the cluster-algebra framework.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The realization that all $\omega_v$ lie in $C_A$ suggests that in the exceptional types the rays may also be expressible as small alternating sums of compatibility-degree vectors; extending the computer check to search for such expressions would give structural formulas matching the classical ray lists.
Because setting frozen variables to $1$ recovers the no-frozen case, the explicit polyhedral descriptions here are compatible with coefficient specialization; this suggests that other choices of frozen variables should produce Gröbner cones obtained by linear projections of the same cones, connecting these ray lists to tropical cluster varieties.
The circular term order produced by summing all $\omega_v$ is uniform but likely far from minimal; a testable extension is to find whether a small subset of cluster variables already gives an interior point of $C_A$, which would yield cheaper term orders for explicit computation.
The computer verification for exceptional types is a black box in the paper; an independent, non-computational proof of Proposition 4.1.2 for one exceptional type would likely reveal combinatorial structures analogous to the exchange quadrilaterals used in the classical types.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Here's my read. The paper has two real achievements. First, Theorem 4.1.1: for any cluster variable v, the compatibility-degree vector ω_v lies in the Gröbner cone. That's a clean, general statement, and the proof via Proposition 4.1.2 is sensible: reduce to no-frozen, indecomposable, then handle classical types combinatorially and exceptional types by computation. Second, the explicit generators for rays and lineality spaces in types A–D, with and without frozen variables, are new and concrete, and they recover the Speyer–Sturmfels description for G(2,n). The proof of Conjecture 6.2.9 of INCT21 is a nice bonus and follows from the same circle of ideas.

The classical-type proofs are the real meat. Lemma 4.2.1 is asserted by inspection of three configurations; I believe it, but a referee should ask the authors to spell it out or justify it more algebraically. The type D case analysis in §4.2 is intricate, but the exchange quadrilaterals make it readable. The reduction to no-frozen and indecomposable blocks is sound.

The soft spot is the exceptional types, E6–E8, F4, G2. Proposition 4.1.2 there rests on a Sage verification, and the code is only in the ancillary file [IS25]. That is not fatal—the algorithm in §4.3 is described carefully, including how exchange relations are reconstructed from g-vectors and compatibility via maximum cliques. But it is load-bearing. If the clique reconstruction silently fails on some pair, Theorem 4.1.1 could be false for an exceptional type. I'd want the code to be run end-to-end and the output logged before treating the universal statement as fully checked. I'd be surprised if it fails, but surprise isn't proof. The same caveat applies to the parity claim in Remark 4.5.4, which feeds into the F4 pointedness result. None of this undermines the classical-type results, which stand on their own.

The citation pattern is fine: results from INCT21 are used in the direction in which they were proved, and the authors are explicit about what is new and what is a computer calculation. The paper is honest about its own limits.

Who is this for? Anyone working on cluster algebra deformations, Gröbner bases, or the tropical Grassmannian. It's a within-subfield advance, not a breakthrough, but it's a solid one. I'd send it to a serious referee, and I'd want the ancillary code bundled with the final version, ideally with a short log showing the script ran to completion.

Referee Report

2 major / 4 minor

Summary. The paper studies the Gröbner cone C_A parametrizing weights whose initial degeneration of the relation ideal I_A of a finite-type cluster algebra A is the Stanley-Reisner ideal I^×_A generated by products of incompatible cluster variables. The main theorem (Theorem 4.1.1) asserts that for every cluster variable v, the compatibility-degree vector ω_v = [(v||y)]_{y ∈ V∪W} lies in C_A. The authors prove this by reducing to indecomposable finite types: a combinatorial cross-counting argument covers A_n, B_n, C_n, D_n (§4.2), and a SageMath verification covers E_6, E_7, E_8, F_4, G_2 (§4.3). From this they derive an interior point of C_A giving a circular term order (Corollary 4.5.1), prove Conjecture 6.2.9 of [INCT21] (Corollary 4.4.1), and give explicit ray and lineality-space generators for the cone in the classical types, both with the special frozen variables of §3 (Propositions 5.1.1–5.1.2, Theorems 5.2.1–5.2.2) and without frozen variables (Theorems 6.1.1–6.1.4).

Significance. If fully justified, the results are a substantial contribution to the combinatorial and computational algebra of cluster algebras. Theorem 4.1.1 is a clean universal statement with a short and natural proof once Proposition 4.1.2 is established, and it yields concrete consequences: an explicit circular term order, a proof of a published conjecture, and complete ray/lineality descriptions that recover Speyer and Sturmfels' tropical Grassmannian result as a special case. A particular strength of the paper is that the central theorem is not obtained by fitting parameters; it is a proof by reduction to finite types, with the computational part explicitly isolated and honestly identified. The explicit descriptions in §§5–6 are falsifiable and likely to be useful for future work on degenerations of cluster algebras. The main unresolved question is whether the computational verification for the exceptional types is sufficiently self-contained and independently checkable.

major comments (2)

[§4.3, Proposition 4.1.2] The universal assertion of Theorem 4.1.1 depends on the verification of Proposition 4.1.2 for E6, E7, E8, F4, and G2. The text describes an algorithm but the only evidence is the SageMath code relegated to the ancillary reference [IS25]; the correctness of the exchange-relation reconstruction is not independently established. In particular, taking S_{λ,μ} to be "a maximum clique" of the graph of variables compatible with λ and μ assumes that this clique is the common extended cluster; non-uniqueness, or failure of the expansion of λ+μ and λ⊎μ to have non-negative coefficients on S_{λ,μ}∪{λ}, would silently invalidate the inequality (4.1.3). The same auxiliary computation underlies Remark 4.5.4 and therefore Theorem 4.5.5 for F4. Please include the code or, at minimum, a precise certificate of its verified output for each type, and state explicitly the correctness conditions under which the clique-reconstruction algorithm recovers every exchange relation.
[§5.3, Lemma 5.3.1] The proof of Proposition 5.1.2 and Theorem 5.2.2 in type D_n relies on the assertion that every extended exchange matrix in the D_n model has rank n−1, so that the lineality space of C_A has dimension one more than the number of frozen variables. The text says this is "straightforward to verify" but gives no argument or reference. Since the claimed basis of the lineality space and the ray-generation statements both depend on this rank fact, please supply a proof or an explicit citation.

minor comments (4)

[§4.2, Lemma 4.2.1] The proof of Lemma 4.2.1 is by inspection of three configurations. The combinatorial claim is plausible and the figure helps, but since Proposition 4.1.2 for all classical types rests on this lemma, a short coordinate-based proof or an explicit list of crossing inequalities would make the argument easier to verify.
[Example 3.2.3] There is a typo in the sentence "it is straightforward to calculate that the Gröbner cone A has lineality space generated by"; it should read "the Gröbner cone C_A of A has lineality space generated by".
[Throughout] The manuscript contains several spacing and punctuation artifacts, such as "Theorems 5.1.1 5.1.2" in the Introduction and "the coneCA" in Definition 2.2.3. A careful copyedit would improve readability.
[References] The reference [INCT21] is cited as arXiv:2111.02566v1; if a later or published version exists, the authors should update the citation.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; Theorem 4.1.1 and the ray/lineality descriptions are proved from independent combinatorial, root-system, and computer-checked inputs, with self-citations used only as background.

full rationale

The paper's central claim (Theorem 4.1.1) is that omega_v = [(v||y)] belongs to C_A. This is proved by establishing Proposition 4.1.2, an independent inequality (4.1.3) for every exchange relation, checked in types A_n, B_n, C_n, D_n by explicit polygon combinatorics (Lemmas 4.2.1 and 4.2.2) and in types E6, E7, E8, F4, G2 by a SageMath verification described in Section 4.3. Neither the statement nor the proof defines omega_v in terms of C_A, and no parameter is fitted to any subset of the cone; the duality with C_prim is cited from prior work (Lemma 2.2.4, [INCT21, Cor. 5.3.2]) and used in the direction proved there. The later ray and lineality descriptions in Sections 5 and 6 are derived from the primitive-exchange degrees and the same polygon combinatorics, not from the conclusion. The only load-bearing external input not reproduced in the text is the computer check for exceptional types; that is a reproducibility or correctness risk, not a circularity, because the computation tests the same inequality (4.1.3) against independently defined compatibility degrees and exchange relations. Self-citations to [INCT21] are present but are background theorems, and no step reduces to an unverified assertion that the present result holds.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

The paper's results are built on standard background theorems in cluster algebra theory (finite type classification, polygon models, Coxeter-element descriptions of exchange relations) and on a computer verification for exceptional types whose code is referenced but not included in the text. There are no free parameters and no invented entities.

assumptions (7)

domain assumption Lemma 2.2.4 (from [INCT21, Cor. 5.3.2]): C_A is the dual cone of Cprim, the cone generated by degrees of primitive exchange relations.
This characterization is the starting point for every proof; the paper cites it rather than proving it.
domain assumption Classification of finite type cluster algebras by finite type Cartan matrices (FZ03a, Theorem 1.4).
Used to split the proof of Proposition 4.1.2 into Dynkin types.
domain assumption Combinatorial models for types A_n, B_n, C_n, D_n via diagonals and edge or diameter pairs in regular polygons (FZ03a, FZ03b).
The compatibility degree formulas and exchange relations in these models underlie all classical type arguments.
domain assumption Yang-Zelevinsky and Stella theorems: cluster variables parametrized by weights in Pi(c); compatibility degrees via c-compatibility; exchange relations x_lambda x_mu = x_{lambda+mu} + x_{lambda circ mu}.
Used in Section 4.3 to compute compatibility degrees and exchange relations for exceptional types.
ad hoc to paper Correctness of the SageMath computation verifying Proposition 4.1.2 for E6, E7, E8, F4, G2 (code referenced as [IS25]).
The universal statement of Theorem 4.1.1 relies on this computational verification, which is not proved in the text.
ad hoc to paper In type D_n, any extended exchange matrix has rank n-1 (asserted in the proof of Lemma 5.3.1).
This rank claim determines the dimension of the lineality space; the paper says it is straightforward to verify without giving a proof.
ad hoc to paper Remark 4.5.4: the permutation T has no even-sized orbits exactly for types A_n, B_n, C_n (n even) and F4; exceptional cases checked with SageMath.
Theorem 4.5.5 on ray generation depends on this parity assertion.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Gr\"obner Cones for Finite Type Cluster Algebras." pith.science (2026). https://pith.science/paper/WKETJ6DZ

@misc{pith2026250107065,
  author       = {Pith},
  title        = {Pith review of: Gr\"obner Cones for Finite Type Cluster Algebras},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WKETJ6DZ}},
  note         = {Machine review of arXiv:2501.07065}
}

abstract

Let $\mathcal{A}$ be a cluster algebra of finite cluster type. We study the Gr\"obner cone $\mathcal{C}_{\mathcal{A}}$ parametrizing term orders inducing an initial degeneration of the ideal $I_{\mathcal{A}}$ of relations among the cluster variables of $\mathcal{A}$ to the ideal generated by products of incompatible cluster variables. We show that for any cluster variable $v$, the weight induced by taking compatibility degrees with $v$ belongs to $\mathcal{C}_{\mathcal{A}}$. This allows us to construct an explicit circular term order and prove a conjecture of Ilten, N\'ajera Ch\'avez, and Treffinger. Furthermore, we give explicit descriptions of the rays and lineality spaces of $\mathcal{C}_{\mathcal{A}}$ in terms of combinatorial models for cluster algebras of types $A_n$, $B_n$, $C_n$, $D_n$ with a special choice of frozen variables, and in the case of no frozen variables.

Figures

Figures reproduced from arXiv: 2501.07065 by the authors.

**Figure 1.** The polygon P8 Proposition 3.2.1 ([FZ03a, Proposition 12.5], [FZ03b, Proposition 3.14]). Let n ≥ 1. There exists a cluster algebra A of type An, a bijection between cluster variables of A and diagonals Pn+3, and a bijection between frozen variables of A and edges of Pn+3 satisfying the following: (1) Clusters are in bijection with triangulations of Pn+3. (2) For a diagonal or an edge l, denote the corresponding clus… view at source ↗

**Figure 2.** Exchange quadrilaterals a b c d a b c d (A): Type 1 exchange quadrilateral a b c a b c (B): Type 4 exchange quadrilaterals [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗

**Figure 3.** Opposite edges of exchange quadrilaterals [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗

Figures from the paper (15 more)

**Figure 4.** Figure 4: Possible positions of l relative to Q with corresponding exchange quadrilateral(s) T = {Q} or T = {Q, Q}, and denote y0 = xx′ . Let v ∈ V be a cluster variable different from x and x ′ with v corresponding to diagonal(s) L = {l} or L = {l, l}. Then, if P is of exchang…

**Figure 5.** Figure 5: Single and double lines in type 2 exchanges (corresponding to Equation (3.3.4)). We will show (4.2.3) holds for some ǫ in each type. Type Bn. For type Bn, by the definition of compatibility degree, ωv ·deg(yi) equals the number of crosses between l and the diagonals in…

**Figure 6.** Figure 6: Equivalence of cross counting in type 3 for Cn (A): |L| = 2 (B): |L| = 1 [PITH_FULL_IMAGE:figures/full_fig_p017_6.png]

**Figure 7.** Figure 7: Crossing in type 4 for Dn Type Dn. Suppose A is of type Dn. Recall from Proposition 3.4.1 that if A = {a, a} and B = {b, b} are sets of diagonals, the compatibility degrees are given by (xa||xb)Dn =    number of crosses between a and b if a and b are diameters, 1 2 …

**Figure 8.** Figure 8: l intersecting both Q and Q [PITH_FULL_IMAGE:figures/full_fig_p019_8.png]

**Figure 9.** Figure 9: l intersecting both Q and Q in a type 4 exchange 4.3. Exceptional Types. In this section, we discuss the computation verifying Proposition 4.1.2 for the exceptional types E6, E7, E8, F4, and G2. For the computation, we use SageMath [The22], including built-in function…

**Figure 10.** Figure 10: Generators of the lineality space in types An, Bn, and Cn i i [PITH_FULL_IMAGE:figures/full_fig_p024_10.png]

**Figure 11.** Figure 11: Generators of the lineality space in type Dn. We will prove this proposition in §5.3. In [PITH_FULL_IMAGE:figures/full_fig_p024_11.png]

**Figure 12.** Figure 12: Generators of the Gr¨obner cone in types An, Bn, and Cn than ⌊N/2⌋. For such l, let Fl be the set of diagonals and edges of PN with both endpoints contained in the minor arc of l. In type An we then set v(l) = − X k∈Fl ek. In types Bn, Cn, Dn we set v(l) = − X k∈Fl e{…

**Figure 13.** Figure 13: Generators of the Gr¨obner cone in type Dn Theorem 5.2.2. For n ≥ 4, let A be the cluster algebra of type Dn with the frozen variables described in §3. Then the elements in the union of the sets {v(l) : l is a diagonal or edge of PN of length at most n − 2} and {w(j, …

**Figure 14.** Figure 14: Primitive quadrilaterals in Lemma 5.3.2 to the number of frozen variables. For A the cluster algebra of type Dn with frozen variables as in §3, the dimension of the lineality space is one more than the number of frozen variables. Proof. By [INCT21, Proposition 5.3.1],…

**Figure 15.** Figure 15: Type 2 exchange in type Bn (Lemma 5.3.3) Proof. We proceed to prove the claim splitting into types. In the figures we reference below, elements of Q(0) are indicated by gray solid lines and elements of Q(1) by dashed black lines. Type An. For type An, the generator Ei…

**Figure 16.** Figure 16: Type 1 or 2 exchange in type Cn (Lemma 5.3.3) = [PITH_FULL_IMAGE:figures/full_fig_p029_16.png]

**Figure 17.** Figure 17: Type 3 exchange in type Cn (Lemma 5.3.3) If [i,i] 6∈ Q(0), all variables in P that have nonzero entries in Ei have multiplicity 1 in P. Therefore, using the above interpretation of Ei · d and breaking down the sum by i and i, (3) of the claim is true. See [PITH_FULL_…

**Figure 18.** Figure 18: Cases in Lemma 5.4.1 Proof. If zero or one of the vertices of Q lie on the arc, the claim is clearly true, since no diagonals or edges of Q can be in F. Since we suppose (Q(0)∪Q(1))∩F 6= {[i, j]}, it is impossible to have exactly two vertices of Q on the arc, unless […

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

19 extracted references · 9 canonical work pages

[1]

Tropical totally positive cluster varieties

Lara Bossinger. Tropical totally positive cluster varieties. arXiv:2208.01723, 2022

arXiv 2022
[2]

Lie groups and L ie algebras

Nicolas Bourbaki. Lie groups and L ie algebras. C hapters 4--6 . Elements of Mathematics (Berlin). Springer-Verlag, Berlin, 2002. Translated from the 1968 French original by Andrew Pressley

2002
[3]

Degenerations to unobstructed F ano S tanley- R eisner schemes

Jan Arthur Christophersen and Nathan Owen Ilten. Degenerations to unobstructed F ano S tanley- R eisner schemes. Math. Z. , 278(1-2):131--148, 2014

work page 2014
[4]

Introduction to cluster algebras

Sergey Fomin, Lauren Williams, and Andrei Zelevinsky. Introduction to cluster algebras. C hapter 6. arXiv:2008.09189, 2021

arXiv 2008
[5]

Introduction to cluster algebras

Sergey Fomin, Lauren Williams, and Andrei Zelevinsky. Introduction to cluster algebras. C hapters 1-3. arXiv:1608.05735, 2021

arXiv 2021
[6]

Cluster algebras

Sergey Fomin and Andrei Zelevinsky. Cluster algebras. I . F oundations. J. Amer. Math. Soc. , 15(2):497--529, 2002

2002
[7]

Cluster algebras

Sergey Fomin and Andrei Zelevinsky. Cluster algebras. II . F inite type classification. Invent. Math. , 154(1):63--121, 2003

2003
[8]

Y -systems and generalized associahedra

Sergey Fomin and Andrei Zelevinsky. Y -systems and generalized associahedra. Ann. of Math. (2) , 158(3):977--1018, 2003

work page 2003

Show all 19 references

[9]

Cluster algebras

Sergey Fomin and Andrei Zelevinsky. Cluster algebras. IV . C oefficients. Compos. Math. , 143(1):112--164, 2007

2007
[10]

Lie groups, L ie algebras, and representations , volume 222 of Graduate Texts in Mathematics

Brian Hall. Lie groups, L ie algebras, and representations , volume 222 of Graduate Texts in Mathematics . Springer, Cham, second edition, 2015. An elementary introduction

2015
[11]

Humphreys

James E. Humphreys. Reflection groups and C oxeter groups , volume 29 of Cambridge Studies in Advanced Mathematics . Cambridge University Press, Cambridge, 1990

1990
[12]

Deformation theory for finite cluster complexes

Nathan Ilten, Alfredo Nájera Chávez, and Hipolito Treffinger. Deformation theory for finite cluster complexes. arXiv:2111.02566v1, 2021

2021 arXiv
[13]

Gr\"obner cones for finite type cluster algebras

Nathan Ilten and Karolyn So. Gr\"obner cones for finite type cluster algebras. arXiv ancillary files, 2025

2025
[14]

The tropical G rassmannian

David Speyer and Bernd Sturmfels. The tropical G rassmannian. Adv. Geom. , 4(3):389--411, 2004

2004
[15]

Exchange relations for finite type cluster algebras with acyclic initial seed and principal coefficients

Salvatore Stella and Pavel Tumarkin. Exchange relations for finite type cluster algebras with acyclic initial seed and principal coefficients. SIGMA Symmetry Integrability Geom. Methods Appl. , 12:Paper No. 067, 9, 2016

2016
[16]

Polyhedral models for generalized associahedra via C oxeter elements

Salvatore Stella. Polyhedral models for generalized associahedra via C oxeter elements. J. Algebraic Combin. , 38(1):121--158, 2013

2013
[17]

Algorithms in invariant theory

Bernd Sturmfels. Algorithms in invariant theory . Texts and Monographs in Symbolic Computation. SpringerWienNewYork, Vienna, second edition, 2008

2008
[18]

S ageMath, the S age M athematics S oftware S ystem ( V ersion 9.5) , 2022

The Sage Developers . S ageMath, the S age M athematics S oftware S ystem ( V ersion 9.5) , 2022

2022
[19]

Cluster algebras of finite type via C oxeter elements and principal minors

Shih-Wei Yang and Andrei Zelevinsky. Cluster algebras of finite type via C oxeter elements and principal minors. Transform. Groups , 13(3-4):855--895, 2008

2008

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.

[1] [1]

Tropical totally positive cluster varieties

Lara Bossinger. Tropical totally positive cluster varieties. arXiv:2208.01723, 2022

arXiv 2022

[2] [2]

Lie groups and L ie algebras

Nicolas Bourbaki. Lie groups and L ie algebras. C hapters 4--6 . Elements of Mathematics (Berlin). Springer-Verlag, Berlin, 2002. Translated from the 1968 French original by Andrew Pressley

2002

[3] [3]

Degenerations to unobstructed F ano S tanley- R eisner schemes

Jan Arthur Christophersen and Nathan Owen Ilten. Degenerations to unobstructed F ano S tanley- R eisner schemes. Math. Z. , 278(1-2):131--148, 2014

work page 2014

[4] [4]

Introduction to cluster algebras

Sergey Fomin, Lauren Williams, and Andrei Zelevinsky. Introduction to cluster algebras. C hapter 6. arXiv:2008.09189, 2021

arXiv 2008

[5] [5]

Introduction to cluster algebras

Sergey Fomin, Lauren Williams, and Andrei Zelevinsky. Introduction to cluster algebras. C hapters 1-3. arXiv:1608.05735, 2021

arXiv 2021

[6] [6]

Cluster algebras

Sergey Fomin and Andrei Zelevinsky. Cluster algebras. I . F oundations. J. Amer. Math. Soc. , 15(2):497--529, 2002

2002

[7] [7]

Cluster algebras

Sergey Fomin and Andrei Zelevinsky. Cluster algebras. II . F inite type classification. Invent. Math. , 154(1):63--121, 2003

2003

[8] [8]

Y -systems and generalized associahedra

Sergey Fomin and Andrei Zelevinsky. Y -systems and generalized associahedra. Ann. of Math. (2) , 158(3):977--1018, 2003

work page 2003