alphaFeedback

WorksMathematics

Factorial denominators of rank-two scattering coefficients

AI contributions
  • GPT-6-Astra
  • Codex
View details

Abstract

We prove that, for every pair of positive integers i,ji,j, the universal rank-two cluster scattering coefficient τ(i,j)\tau(i,j) satisfies max⁡(i,j)! τ(i,j)∈Z[b,c,g]\max(i,j)!\,\tau(i,j)\in\mathbb{Z}[b,c,g]. This resolves the factorial-denominator conjecture of Elgin, Reading, and Stella (Conjecture 4).

AI use and scholarly credit

The results were obtained within a three-hour Codex session using GPT-6-Astra at high reasoning effort. The arguments and exposition were subsequently reviewed and revised in Codex using the built-in mathematical writing skill. The manuscript passed an AI review using Rethlas-OSV [12, 14, 16].

By posting this manuscript on this platform, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in preparing a finished account or checking the arguments; the eventual scholarly credit should go to those who undertake that work.

Introduction

Cluster algebras, introduced by Fomin and Zelevinsky [7], organize families of generators by repeated mutation. Scattering diagrams encode compatible changes of coordinates by automorphisms attached to walls in a real vector space. Consistency means that the ordered composition along a closed path, avoiding wall intersections, is the identity. The constructions of Kontsevich–Soibelman [13] and Gross–Siebert [11] established this wall-crossing framework. Gross–Hacking–Keel–Kontsevich [8] used cluster scattering diagrams and broken lines to construct theta functions and canonical bases for cluster varieties under their stated hypotheses.

In rank two, walls are rays or lines in a plane. Two initial wall functions determine the outgoing wall functions by consistency. Their coefficients are accessible to computation, but even in this case there are generally infinitely many walls and coefficients. The tropical vertex construction of Gross–Pandharipande–Siebert [10] relates such factorizations to enumerative geometry. Gross–Pandharipande [9] connected the same rank-two factorizations with quiver representations. These interpretations express wall coefficients through invariants of moduli spaces.

Elgin, Reading, and Stella [6], in a preprint first posted in April 2024, proposed eighteen conjectures about rank-two cluster scattering coefficients. Their parameters bb, cc are positive integers specifying the two off-diagonal entries of the rank-two exchange data. For a monomial indexed by positive integers i,ji,j, the primitive normalization introduces the integer g=gcd⁡(ib,jc)/gcd⁡(i,j)g = \gcd(ib,jc)/\gcd(i,j). They sought polynomial formulas τ(i,j)\tau(i,j) in the three parameters, together with degree, divisibility, symmetry, and positivity properties. Their Conjecture 4 asks that multiplication by max⁡(i,j)!\max(i,j)! make every coefficient of this polynomial integral. Thus it bounds the denominators of the universal polynomial, before the parameters are specialized to integers.

Akagi [1] developed explicit dilogarithm computations and structural formulas for rank-two scattering diagrams. In subsequent work [2], he proved several of the polynomiality and structural conjectures of Elgin–Reading–Stella and obtained partial results on others. The proof of Conjecture 11 recorded in [2 Proposition 4.3] is credited there to Burcroff, Lee, and Mou; see [2 Remark 1.4].

Burcroff, Lee, and Mou introduced tight gradings in [3, 4]. These are nonnegative integer assignments to edges of maximal Dyck paths satisfying compatibility conditions. Their formulas express rank-two wall functions as positive sums and connect them to Euler characteristics of quiver moduli and relative Gromov–Witten invariants. They also prove positivity results for generalized cluster scattering diagrams in higher rank. Burcroff, Lee, Mou, Musiker, and Reineke [5] subsequently combined this approach with quiver moduli.

Their Theorem 1.4 proves Conjectures 1–3, 5–10, and 14–18 of Elgin–Reading–Stella. Their Remark 1.5 lists Conjectures 4, 12, and 13 as remaining open. The polynomiality theorem [5 Theorem 1.2] provides the universal coefficients to which the factorial-denominator question applies. We prove Conjecture 4 for every pair i,j>0i,j > 0.

Our proof uses the change of lattice in [5 Proposition 2.5] and the abelian wall-crossing formula of Mozgovoy–Reineke [15 Theorem 8.3]. The latter expands a wall Hamiltonian as a sum over weighted bipartite quivers. Its geometric interpretation [15 Theorem 6.5] replaces each abelian invariant by the Euler characteristic of a moduli space for a small generic deformation. The expansion has denominators from vertex weights and permutations of equal-weight vertices. We choose a deformation retaining the permutations on the side of smaller total weight. The stabilizers of stable trees consist of permutations of leaves with a common neighbor. Semistability bounds the total weight of these leaves by the weight of that neighbor. This clears their denominators with factorials on the larger side. A set-partition count then passes from Hamiltonians to wall functions.

We first define the coefficients algebraically. Let b,cb,c be independent indeterminates and work in the formal power series ring Q[b,c][[x,y]]\mathbb{Q}[b,c][[x,y]], completed by total degree in x,yx,y. For nonnegative integers u,v,r,su,v,r,s, set

{xuyv,xrys}=(us−vr)xu+ryv+s,(1)\{x^u y^v,x^r y^s\}=(us-vr)x^{u+r}y^{v+s}, \tag*{(1)}

and extend this bracket linearly and continuously. A series HH with zero constant term defines the derivation DH={H,−}D_H=\{H,-\}. Its exponential exp⁡(DH)=∑n≥0DHn/n!\exp(D_H)=\sum_{n\geq0}D_H^n/n! is well defined because DHD_H raises total degree. Put

Hx=c∑a≥1(−1)a−1a2xa,Hy=b∑s≥1(−1)s−1s2ys.(2)H_x=c\sum_{a\geq1}\frac{(-1)^{a-1}}{a^2}x^a,\qquad H_y=b\sum_{s\geq1}\frac{(-1)^{s-1}}{s^2}y^s. \tag*{(2)}

These flows act respectively by

(x,y)⟼(x,y(1+x)c),(x,y)⟼(x(1+y)−b,y).(x,y)\longmapsto(x,y(1+x)^c),\qquad(x,y)\longmapsto(x(1+y)^{-b},y).

Composition of automorphisms is read from right to left.

For relatively prime positive integers d,ed,e, let t=xdyet=x^d y^e. The ordered factorization

exp⁡(DHx)exp⁡(DHy)=exp⁡(DHy)(∏d,e>0gcd⁡(d,e)=1e/d decreasingexp⁡(D∑r≥1Hrd,retr))exp⁡(DHx)(3)\exp(D_{H_x})\exp(D_{H_y})=\exp(D_{H_y})\left(\prod_{\substack{d,e>0\\ \gcd(d,e)=1}}^{e/d\ \mathrm{decreasing}}\exp\left(D_{\sum_{r\geq1}H_{rd,re}t^r}\right)\right)\exp(D_{H_x}) \tag*{(3)}

defines Hi,j∈Q[b,c]H_{i,j} \in\mathbb{Q}[b,c] for i,j>0i,j>0. The product is read in the indicated order from left to right. Modulo terms of degree greater than any fixed integer, it is finite. To see existence and uniqueness, filter the Lie algebra of Hamiltonians by degree. At each successive degree, the discrepancy between the two sides has a unique decomposition into its monomials on primitive rays. The map H↦DHH \mapsto D_H is injective on series with zero constant term: bracketing a monomial xuyvx^u y^v with xx and yy detects it unless u=v=0u=v=0. The discrepancy has only mixed monomials, since brackets involving both axes have both exponents positive. Inserting the required terms corrects that degree and changes only higher degrees. Starting at degree two gives (3). Setting either b=0b=0 or c=0c=0 leaves only one axis flow, so uniqueness gives

Hi,j∈bcQ[b,c].(4)H_{i,j} \in bc\mathbb{Q}[b,c]. \tag*{(4)}

Define fd,e(t)∈1+tQ[b,c][[t]]f_{d,e}(t) \in1+t\mathbb{Q}[b,c][[t]] by requiring that the ray factor in (3) act as

x⟼xfd,e(t)−e,y⟼yfd,e(t)d.x \longmapsto x f_{d,e}(t)^{-e}, \qquad y \longmapsto y f_{d,e}(t)^d.

The factor on this ray in (3) fixes tt. Indeed, for K=∑r≥1Hrd,retrK=\sum_{r\geq1}H_{rd,re}t^r, the bracket gives

DK(x)/x=−e∑r≥1rHrd,retrD_K(x)/x=-e\sum_{r\geq1}rH_{rd,re}t^r

and

DK(y)/y=d∑r≥1rHrd,retr.D_K(y)/y=d\sum_{r\geq1}rH_{rd,re}t^r.

Both multiplying series are fixed by DKD_K, so exponentiation gives

log⁡fd,e(t)=∑r≥1rHrd,retr.(5)\log f_{d,e}(t)=\sum_{r\geq1}rH_{rd,re}t^r. \tag*{(5)}

Let gg be a third independent indeterminate. Define τ(rd,re)∈Q[b,c,g]\tau(rd,re)\in\mathbb{Q}[b,c,g] by

1+∑r≥1τ(rd,re)tr=exp⁡(gbclog⁡fd,e(t))=exp⁡(g∑r≥1rHrd,rebctr).(6)1+\sum_{r\geq1}\tau(rd,re)t^r =\exp\left(\frac{g}{bc}\log f_{d,e}(t)\right) =\exp\left(g\sum_{r\geq1}\frac{rH_{rd,re}}{bc}t^r\right). \tag*{(6)}

Here log⁡(1+z)=∑n≥1(−1)n−1zn/n\log(1+z)=\sum_{n\geq1}(-1)^{n-1}z^n/n and the exponential are formal series; (4) makes the right side a series over Q[b,c,g]\mathbb{Q}[b,c,g]. Every pair of positive integers lies on exactly one primitive ray, so this defines all τ(i,j)\tau(i,j). For a series FF, [tr]F[t^r]F denotes its coefficient of trt^r; for a polynomial in gg, [g1]F[g^1]F denotes its coefficient of g1g^1, with absent coefficients equal to zero.

For positive integer values of b,cb,c, the change-of-lattice formula [5 Proposition 2.5] identifies (6) with the cluster wall function after the substitution

g=gcd⁡(db,ec)=gcd⁡(ib,jc)gcd⁡(i,j)g=\gcd(db,ec)=\frac{\gcd(ib,jc)}{\gcd(i,j)}

when (i,j)=k(d,e)(i,j)=k(d,e), k∈Z>0k\in\mathbb{Z}_{>0}.

The initial tropical-vertex functions are (1+x)c,(1+y)b(1+x)^c,(1+y)^b in that order; this fixes the placement of bb and cc.

The following uniqueness statement identifies this polynomial extension with the universal coefficients of [6, 5].

Lemma 1.1. Fix relatively prime positive integers d,ed,e. A polynomial P∈Q[b,c,g]P\in\mathbb{Q}[b,c,g] that vanishes at every positive integer pair b,cb,c with g=gcd⁡(db,ec)g=\gcd(db,ec) is zero.

Proof. Fix a positive integer qq. For each positive integer mm congruent to 1 modulo ee, and every integer h≥0h\geq0, take b=qmb=qm and c=q(1+hdm)c=q(1+hdm). Since gcd⁡(dm,e)=1\gcd(dm,e)=1 and gcd⁡(dm,1+hdm)=1\gcd(dm,1+hdm)=1, these choices have gcd⁡(db,ec)=q\gcd(db,ec)=q. For fixed q,mq,m, the polynomial P(qm,c,q)P(qm,c,q) therefore vanishes at infinitely many values of cc, so it is identically zero as a polynomial in cc. Each of its coefficients, viewed as a polynomial in bb, vanishes at the infinitely many values qmqm with m≡1(mode)m\equiv1\pmod e. Thus P(b,c,q)=0P(b,c,q)=0. Finally, each coefficient in b,cb,c is a polynomial in gg vanishing at every positive integer qq, and is consequently zero.

Theorem 1.2. For every pair of positive integers i,ji,j,

max⁡(i,j)!τ(i,j)∈Z[b,c,g].\max(i,j)!\tau(i,j)\in\mathbb{Z}[b,c,g].

Section 5 deduces the theorem from the bound for [g1]τ(i,j)=gcd⁡(i,j)Hi,j/(bc)[g^1]\tau(i,j)=\gcd(i,j)H_{i,j}/(bc) proved in Proposition 4.2.

Abelian quivers and the wall-crossing formula

A partition λ⊢i\lambda\vdash i is a finite multiset of positive integers with sum ii. Let mam_a be the number of its parts equal to aa, and p=∑a≥1map=\sum_{a\geq1}m_a its length. For μ⊢j\mu\vdash j, write nsn_s for the multiplicity of ss and ℓ=∑s≥1ns\ell=\sum_{s\geq1}n_s for the length. Thus ∑aama=i\sum_a am_a=i and ∑ssns=j\sum_s sn_s=j. Products indexed by positive integers include only nonzero multiplicities; we use 0!=10!=1 and the empty product 11. For example, the partition (2,1,1)(2,1,1) has m1=2,m2=1m_1=2,m_2=1 and length three.

Associate to (λ,μ)(\lambda,\mu) a quiver with one individually labelled vertex for each part. Vertices from μ\mu are sources and those from λ\lambda are sinks. Between a source of weight ss and a sink of weight aa there are asas distinct arrows, all directed towards the sink. A thin representation assigns C\mathbb{C} to every vertex and a complex scalar to every arrow. Isomorphisms rescale the bases at vertices: multiplication by a nonzero scalar at a vertex multiplies each incoming arrow scalar and divides each outgoing arrow scalar by that value. A common rescaling at every vertex acts trivially.

We describe stability for any such weighted bipartite quiver. Write LL for its source set, RR for its sink set, and wv>0w_v>0 for the integer weight of a vertex vv. Set

A=∑l∈Lwl,B=∑r∈Rwr,θl=Bwl,θr=−Awr.A=\sum_{l\in L}w_l,\qquad B=\sum_{r\in R}w_r,\qquad\theta_l=Bw_l,\quad\theta_r=-Aw_r.

For a dimension vector α=(αv)v∈L⊔R\alpha=(\alpha_v)_{v\in L\sqcup R} with nonnegative integer entries, define

Aα=∑l∈Lwlαl,Bα=∑r∈Rwrαr,θ(α)=BAα−ABα.A_\alpha=\sum_{l\in L}w_l\alpha_l,\qquad B_\alpha=\sum_{r\in R}w_r\alpha_r,\qquad\theta(\alpha)=BA_\alpha-AB_\alpha.

The slope of a nonzero such vector is

μθ(α)=θ(α)Aα+Bα.(7)\mu_\theta(\alpha)=\frac{\theta(\alpha)}{A_\alpha+B_\alpha}. \tag*{(7)}

The denominator is positive. For a vertex subset UU, its indicator dimension vector has entry one on UU and zero elsewhere; write θ(U)\theta(U) and μθ(U)\mu_\theta(U) for its parameter and, when U≠∅U\ne\varnothing, its slope. The full thin dimension has parameter and slope zero. A thin representation is θ\theta-stable if every nonzero proper subrepresentation has negative parameter, and θ\theta-semistable if every such parameter is nonpositive.

For the quiver of (λ,μ)(\lambda,\mu), these definitions use A=j,B=iA=j,B=i. Choose a sufficiently small rational deformation of the vertex parameters. For rational parameters θv′\theta'_v with ∑vθv′=0\sum_v\theta'_v=0, use

θ′(α)=∑vθv′αv,μθ′(α)=∑vθv′αv∑vwvαv(α≠0).\theta'(\alpha)=\sum_v\theta'_v\alpha_v,\qquad\mu_{\theta'}(\alpha)=\frac{\sum_v\theta'_v\alpha_v}{\sum_v w_v\alpha_v}\quad(\alpha\ne0).

Choose θ′\theta' close to θ\theta so that the slopes of distinct nonempty subsets are different and every originally strict slope ordering is preserved. Such deformations exist by avoidance of finitely many proper hyperplanes, as in [15 Lemma 6.1]. Let Mλ,μdefM^{\mathrm{def}}_{\lambda,\mu} be the geometric moduli space of stable thin representations for this deformation, obtained by taking the geometric quotient of the stable locus by vertex rescalings. Rational parameters may be multiplied by a common positive denominator to give an integral stability character; this leaves stability unchanged. For a complex algebraic variety XX, let Hcn(X,Q)H_c^n(X,\mathbb{Q}) be its compactly supported rational cohomology in degree nn, and define its compactly supported Euler characteristic by

χc(X)=∑n≥0(−1)ndim⁡QHcn(X,Q).\chi_c(X)=\sum_{n\geq0}(-1)^n\dim_{\mathbb{Q}}H_c^n(X,\mathbb{Q}).

Write

Gλ,μ=χc(Mλ,μdef),(8)G_{\lambda,\mu}=\chi_c(M^{\mathrm{def}}_{\lambda,\mu}), \tag*{(8)}

where the deformation satisfies the conditions just stated.

For dimension vectors α,β\alpha,\beta, the antisymmetric Euler pairing in the convention of [15] is

⟨α,β⟩=AβBα−AαBβ.(9)\langle\alpha,\beta\rangle=A_{\beta}B_{\alpha}-A_{\alpha}B_{\beta}. \tag*{(9)}

Equality of slopes for nonzero dimension vectors α,β\alpha,\beta gives

(A+B)(AαBβ−AβBα)=0,(A+B)(A_{\alpha}B_{\beta}-A_{\beta}B_{\alpha})=0,

so (9) vanishes on vectors of equal slope. This is the hypothesis of [15 Definition 3.6]. Theorem 6.5 there identifies the abelian invariant with the virtual motive of Mλ,μdefM^{\mathrm{def}}_{\lambda,\mu}. At motivic parameter one, this is (8). In particular, Gλ,μG_{\lambda,\mu} is independent of the permitted deformation; see also [15 Remark 6.7].

Proposition 2.1. For all i,j>0i,j>0, the Hamiltonian coefficient in (3) is

Hi,j=∑λ⊢iμ⊢j(−1)i+j−p−ℓcpbℓGλ,μ∏a≥1ma!a2ma∏s≥1ns!s2ns.(10)H_{i,j}=\sum_{\substack{\lambda\vdash i\\ \mu\vdash j}}\frac{(-1)^{i+j-p-\ell}c^{p}b^{\ell}G_{\lambda,\mu}}{\prod_{a\geq1}m_a!a^{2m_a}\prod_{s\geq1}n_s!s^{2n_s}}. \tag*{(10)}

Proof. Apply [15 Theorem 8.3, equation (31)] to the charge lattice Z2\mathbb{Z}^{2} with determinant pairing. Let vv be an indeterminate. The quantum torus has basis elements XαX^{\alpha}, α∈Z2\alpha\in\mathbb{Z}^{2}, over Q(v)[b,c]\mathbb{Q}(v)[b,c], with multiplication

XαXβ=vdet⁡(α,β)Xα+β,X^{\alpha}X^{\beta}=v^{\det(\alpha,\beta)}X^{\alpha+\beta},

where det⁡((u1,u2),(r1,r2))=u1r2−u2r1\det((u_{1},u_{2}),(r_{1},r_{2}))=u_{1}r_{2}-u_{2}r_{1}. We use its subalgebra on nonnegative charges, completed by total degree; the motivic parameter is v2v^{2}. For each nonzero nonnegative charge α\alpha, let Ω‾α\overline{\Omega}_{\alpha} denote its input coefficient in the Hamiltonian of the wall-crossing identity. The corresponding quantum exponential has exponent ∑αΩ‾αXα/(v−v−1)\sum_{\alpha}\overline{\Omega}_{\alpha}X^{\alpha}/(v-v^{-1}), summed along one ray. For positive integers a,sa,s, take

Ω‾(a,0)=c(−1)a−1a2,Ω‾(0,s)=b(−1)s−1s2;\overline{\Omega}_{(a,0)}=c\frac{(-1)^{a-1}}{a^{2}},\qquad\overline{\Omega}_{(0,s)}=b\frac{(-1)^{s-1}}{s^{2}};

All input coefficients on mixed charges are zero. For a fixed total-degree truncation, the theorem is a universal polynomial identity in finitely many initial coefficients. We may therefore adjoin the independent indeterminates b,cb,c and make these substitutions. Its associated quiver has det⁡((a,0),(0,s))=as\det((a,0),(0,s))=as arrows from the charge (0,s)(0,s) to (a,0)(a,0), which is exactly the quiver defined above.

We take the classical limit on conjugation actions. For elements U,VU,V of the quantum torus write [U,V]=UV−VU[U,V]=UV-VU. For an invertible element SS, let Ad⁡(S)\operatorname{Ad}(S) denote the conjugation U↦SUS−1U\mapsto SUS^{-1}. Apply the virtual Poincaré polynomial to the motivic coefficients. For nonzero nonnegative charges α,β\alpha,\beta,

[Xα,Xβ]v−v−1=vdet⁡(α,β)−v−det⁡(α,β)v−v−1Xα+β→v→1det⁡(α,β)Xα+β.(11)\frac{[X^{\alpha},X^{\beta}]}{v-v^{-1}}=\frac{v^{\det(\alpha,\beta)}-v^{-\det(\alpha,\beta)}}{v-v^{-1}}X^{\alpha+\beta}\xrightarrow{v\to1}\det(\alpha,\beta)X^{\alpha+\beta}. \tag*{(11)}

For a positive integer nn, the quotient (vn−v−n)/(v−v−1)(v^{n}-v^{-n})/(v-v^{-1}) is vn−1+vn−3+⋯+v1−nv^{n-1}+v^{n-3}+\cdots+v^{1-n} and has value nn at v=1v=1. For n=0n=0 it is zero, and negative nn follow by changing the sign. This proves the limit in (11).

For a quantum series HH of positive total degree with coefficients regular at v=1v=1, write H∣v=1H|_{v=1} for its commutative specialization, where X(u1,u2)X^{(u_{1},u_{2})} becomes xu1yu2x^{u_{1}}y^{u_{2}}. The identity

Ad⁡exp⁡(Hv−v−1)=∑n≥01n!([H,−]v−v−1)n\operatorname{Ad}\exp\left(\frac{H}{v-v^{-1}}\right)=\sum_{n\geq0}\frac{1}{n!}\left(\frac{[H,-]}{v-v^{-1}}\right)^{n}

has only finitely many contributing terms in each total degree. Equation (11) makes each term regular at v=1v=1; specializing gives exp⁡(DH∣v=1)\exp(D_H|_{v=1}).

Theorem 6.5 and Corollary 6.6 of [15], with (9), make the output abelian invariants Laurent polynomials in vv, whose values at one are Gλ,μG_{\lambda,\mu}. In the original charge coordinates (u1,u2)(u_1,u_2) (sink weight, source weight), take the central charge Z(u1,u2)=ju1−iu2+−1(u1+u2)Z(u_1,u_2)=ju_1-iu_2+\sqrt{-1}(u_1+u_2). For a nonzero nonnegative charge, its slope is −Re⁡Z/Im⁡Z=(iu2−ju1)/(u1+u2)-\operatorname{Re} Z/\operatorname{Im} Z=(iu_2-ju_1)/(u_1+u_2). The map from vertex dimensions to charges is α↦(Bα,Aα)\alpha\mapsto(B_\alpha,A_\alpha), which gives (7). The two basis charges have slopes −j<i-j<i, so this is the chamber c+c_+ of [15 §8]. Its clockwise order is decreasing u2/u1u_2/u_1, with the vertical axis first. The reverse, axis-only order is therefore the left side of (3). Thus the ordered quantum identity specializes to (3), whose coefficients are unique. Equation (31) of [15] has one multiplicity factorial for each distinct input charge. Grouping its nonzero inputs into partitions gives the factors ma!m_a!, ns!n_s!, while the axis coefficients contribute a2maa^{2m_a}, s2nss^{2n_s}. Their signs multiply to (−1)i+j−p−ℓ(-1)^{i+j-p-\ell}, and their parameter powers to cpbc^{pb}. This is (10).

Stable supports and a symmetric deformation

A support of a thin representation is the set of arrows whose scalars are nonzero. A subset of vertices defines a subrepresentation precisely when it is closed under all arrows in the support: an arrow with source in the subset must also have its target there. Stability therefore depends only on the support. A tree will mean a connected undirected graph with no cycles. A spanning tree contains every vertex, and a leaf is a vertex of degree one. For a tree TT, write E(T)E(T) for its edge set and deg⁡T(v)\operatorname{deg}_T(v) for the number of edges incident to a vertex vv.

Lemma 3.1. For any permitted generic deformation, Gλ,μG_{\lambda,\mu} is the number of stable spanning-tree supports, with distinct parallel arrows counted separately. Equivalently,

Gλ,μ=∑T stable∏vwvdeg⁡T(v)(12)G_{\lambda,\mu}=\sum_{\substack{T\ \mathrm{stable}}}\prod_v w_v^{\operatorname{deg}_T(v)} \tag*{(12)}

where the sum is over stable spanning trees in the underlying simple complete bipartite graph.

Proof. Every stable support is connected. Otherwise each connected component is a nonzero proper subrepresentation and hence has strictly negative parameter. Summing over components would contradict total parameter zero.

Fix a connected support with VV vertices and EE arrows. Its nonzero arrow scalars form (C∗)E(\mathbb{C}^*)^E. Choose one spanning tree in the support and a base vertex. Successive vertex rescalings, starting at that vertex, normalize all its tree scalars to one. The common scalar at all vertices acts trivially, and no other rescaling preserves the normalized tree scalars. Thus the geometric quotient of this support stratum is (C∗)E−V+1(\mathbb{C}^*)^{E-V+1}. The finitely many support strata are locally closed and partition the stable moduli space.

Euler characteristic is additive over such strata, and χc((C∗)n)=0\chi_c((\mathbb{C}^*)^n)=0 for n>0n>0, whereas it is one for n=0n=0. Only spanning trees contribute. For an underlying simple bipartite tree TT, each edge lrlr admits wlwrw_lw_r choices of a parallel arrow; all have the same closed vertex subsets. The number of resulting supports is

∏lr∈E(T)wlwr=∏vwvdeg⁡T(v).\prod_{lr\in E(T)}w_lw_r=\prod_v w_v^{\operatorname{deg}_T(v)}.

For the denominator estimate we orient the smaller total-weight side as the sources, so that A≤BA\le B. If the original orientation is opposite, dualize every representation and reverse all arrows, and replace θ\theta by −θ-\theta. A subrepresentation of the dual corresponds to the dual of a quotient of the original representation. Write dim⁡M\dim M for the vector of dimensions at the vertices and M∗M^* for the representation obtained by dualizing its vector spaces and arrow maps. If UU is a subrepresentation of MM, then (M/U)∗(M/U)^* is a subrepresentation of M∗M^* and

(−θ)(dim⁡(M/U)∗)=−θ(dim⁡M−dim⁡U)=θ(dim⁡U).(-\theta)(\dim(M/U)^*)=-\theta(\dim M-\dim U)=\theta(\dim U).

Every subrepresentation of M∗M^* arises this way, so both stability inequalities are preserved. This duality induces an isomorphism of the corresponding moduli spaces, and hence preserves Gλ,μG_{\lambda,\mu}. After this operation the parameters again have the form θl=Bwl,θr=−Awr\theta_l=Bw_l,\theta_r=-Aw_r.

Lemma 3.2. When A≤BA\le B, the invariant Gλ,μG_{\lambda,\mu} can be computed by a set of stable trees that is invariant under permutations of equal-weight source vertices. Every tree in this set is semistable for the original parameter θ\theta.

Proof. Choose small rational numbers εr\varepsilon_r, one for each sink rr, and first deform the parameters by

δθr=εr,δθl=−wlA∑r∈Rεr.(13)\delta\theta_r=\varepsilon_r,\qquad\delta\theta_l=-\frac{w_l}{A}\sum_{r\in R}\varepsilon_r. \tag*{(13)}

Their total change is zero, and equal-weight sources receive equal changes. For a vertex subset UU, set AU=∑l∈U∩LwlA_U=\sum_{l\in U\cap L}w_l. Then

δθ(U)=∑r∈U∩Rεr−AUA∑r∈Rεr.(14)\delta\theta(U)=\sum_{r\in U\cap R}\varepsilon_r-\frac{A_U}{A}\sum_{r\in R}\varepsilon_r. \tag*{(14)}

For every nonempty proper UU, this linear form is nonzero. If U∩R=∅U\cap R=\varnothing, identically zero would imply AU=0A_U=0 and hence U=∅U=\varnothing. If U∩R=RU\cap R=R, it would imply AU=AA_U=A and hence U=L∪RU=L\cup R. If U∩RU\cap R is nonempty and proper, its coefficients take the two distinct values 1−AU/A1-A_U/A and −AU/A-A_U/A, so cannot all vanish.

First choose a neighborhood of zero in the ε\varepsilon-space on which the ordering of every pair of nonempty subsets with distinct original slopes is preserved. Such a neighborhood exists because there are finitely many pairs and their denominators are fixed and positive. Within it, avoid the finitely many proper hyperplanes on which an originally zero-parameter proper subset retains parameter zero. Rational points outside these hyperplanes exist. The resulting first deformation has nonzero parameter on every nonempty proper subset. Hence stability and semistability coincide for the full thin dimension, and every stable representation is originally semistable. Its stable supports are invariant under the indicated source permutations.

Now make a second, smaller rational deformation within the hyperplane of total parameter zero. Require it to preserve every strict subset-slope comparison at the first stage, and make the slopes of all distinct nonempty subsets different. For a subset UU, let 1U\mathbf{1}_U have entry one on UU and zero elsewhere. For distinct nonempty subsets U,VU,V, equality of their slopes is the linear equation with coefficient vector

1U∑v∈Uwv−1V∑v∈Vwv.\frac{\mathbf{1}_U}{\sum_{v\in U}w_v}-\frac{\mathbf{1}_V}{\sum_{v\in V}w_v}.

For nonnested subsets this vector has opposite signs on U∖VU\setminus V and V∖UV\setminus U. If U⊂VU\subset V, positivity of the weights makes its entries positive on UU and negative on V∖UV\setminus U; the other inclusion reverses the signs. It is therefore not a constant vector, so its linear form is nonzero on the hyperplane of total parameter zero. The slope equalities thus define finitely many proper hyperplanes to avoid.

Every comparison of a proper subset with the full dimension was already strict after the first deformation. It is unchanged after the second, so the two full-dimensional stable loci coincide. The second deformation also preserves every originally strict subset-slope order, and therefore satisfies all the conditions of [15 Lemma 6.1]. By [15 Theorem 6.5] it computes Gλ,μG_{\lambda,\mu}. Lemma 3.1 then computes that same invariant using the tree set of the first deformation.

The factorial bound for Hamiltonians

We keep A≤BA \le B, and choose the stable tree set of Lemma 3.2. For a sink rr, let LrL_r be the set of source leaves adjacent to rr. For a positive integer aa, let mr,am_{r,a} be the number of vertices in LrL_r of weight aa.

Lemma 4.1. For every sink rr and every tree in this set,

∑a≥1amr,a≤wr.(15)\sum_{a \ge1} a m_{r,a} \le w_r. \tag*{(15)}

Proof. The subset U=Lr∪{r}U = L_r \cup\{r\} is closed under all arrows of the tree support, since each source in LrL_r has only rr as a neighbor and rr is a sink. If LrL_r is nonempty and UU is proper, original semistability gives

B∑a≥1amr,a−Awr≤0.B \sum_{a \ge1} a m_{r,a} - A w_r \le0.

As A≤BA \le B, this implies (15). If UU is the full vertex set, all sources are leaves at rr and R={r}R = \{r\}, so the same bound is A≤B=wrA \le B = w_r. If LrL_r is empty, the left side is zero.

Proposition 4.2. For every i,j>0i,j > 0, with k=gcd⁡(i,j)k = \gcd(i,j) and B=max⁡(i,j)B = \max(i,j),

B!kHi,jbc∈Z[b,c].(16)B! \frac{kH_{i,j}}{bc} \in\mathbb{Z}[b,c]. \tag*{(16)}

Proof. Fix a pair of partitions in (10), orient the smaller side as the sources, and write A=min⁡(i,j)A = \min(i,j). Let maLm_a^L be the number of sources of weight aa, and nsRn_s^R the number of sinks of weight ss. Writing SnS_n for the permutation group of an nn-element set, the source permutation group

GL=∏a≥1SmaLG_L = \prod_{a \ge1} S_{m_a^L}

permutes equal-weight sources and fixes every sink. The stable underlying trees form a GLG_L-invariant set. The weight ∏vwvdeg⁡T(v)\prod_v w_v^{\deg_T(v)} is constant on each orbit.

Suppose first that a tree TT has at least three vertices. A permutation in GLG_L fixing TT can move a nonleaf source only to a source with the same neighbors. Two distinct sources with the same two distinct sink neighbors would give a cycle of length four, impossible in a tree. Thus every nonleaf source is fixed. The subgroup Stab⁡GL(T)\operatorname{Stab}_{G_L}(T) fixing TT consists precisely of arbitrary permutations among equal-weight source leaves with the same sink neighbor. Its order is

∣Stab⁡GL(T)∣=∏r∈R∏a≥1mr,a!.(17)\left|\operatorname{Stab}_{G_L}(T)\right| = \prod_{r \in R}\prod_{a \ge1} m_{r,a}!. \tag*{(17)}

The source multiplicity factorials in (10) form ∣GL∣|G_L|. By the orbit-stabilizer formula, summing one orbit and dividing by all the multiplicity and squared-weight factors gives

∏vwvdeg⁡T(v)−2(∏s≥1nsR!)∏r∈R∏a≥1mr,a!.(18)\frac{\prod_v w_v^{\deg_T(v)-2}}{\left(\prod_{s \ge1} n_s^R!\right)\prod_{r \in R}\prod_{a \ge1}m_{r,a}!}. \tag*{(18)}

The common sign and monomial in b,cb,c have been left out of this numerical expression. Negative weight exponents in (18) occur only at leaves. For each nonleaf sink rr, combine the factors from its source-leaf neighbors and their permutations:

∏a≥1amr,amr,a!∣wr!.\prod_{a \ge1} a^{m_{r,a}}m_{r,a}! \mid w_r!.

Indeed, place disjoint blocks of size aa, one for each such leaf, inside a set of wrw_r elements, which is possible by Lemma 4.1. Cyclic rotations on the blocks and permutations of the blocks of equal size give a faithful permutation group of order ∏aamr,amr,a!\prod_a a^{m_{r,a}}m_{r,a}!. It is a subgroup of SwrS_{w_r}, so its order divides wr!w_r!.

A sink leaf cannot be adjacent to a source leaf in a tree with at least three vertices. Its only weight denominator is therefore wrw_r, which also divides wr!w_r!. All other weight exponents in (18) are nonnegative. It follows that the denominator of (18), in lowest terms, divides

(∏s≥1nsR!)∏r∈Rwr!=∏s≥1nsR!(s!)nsR,∏s≥1nsR!(s!)nsR∣B!.(19)\left(\prod_{s\geq1}n_s^R!\right)\prod_{r\in R}w_r!=\prod_{s\geq1}n_s^R!(s!)^{n_s^R},\qquad\prod_{s\geq1}n_s^R!(s!)^{n_s^R}\mid B!. \tag*{(19)}

The second divisibility follows because the quotient counts the partitions of a labelled BB-element set into nsRn_s^R unordered blocks of size ss for each ss. Consequently B!B! clears every orbit contribution from trees with at least three vertices.

If the quiver has exactly two vertices, their weights are AA and BB. There are ABAB stable single-arrow supports: the only nonzero proper closed subset is the sink, whose original parameter is strictly negative and remains so under the deformation. The quotient of this tree count by the squared-weight factor is 1/(AB)1/(AB). Multiplying by k=gcd⁡(A,B)k=\gcd(A,B) replaces it by

kAB=1lcm⁡(A,B).\frac{k}{AB}=\frac{1}{\operatorname{lcm}(A,B)}.

Both AA and BB divide B!B!, hence so does their least common multiple. This handles the two-vertex term.

Each mixed-charge partition pair has p,ℓ≥1p,\ell\geq1, so its monomial cpbℓc^pb^\ell in (10) is divisible by bcbc. After division by bcbc, the orbit estimates and the two-vertex computation show that every contribution to B!kHi,j/(bc)B!kH_{i,j}/(bc) is an integer-coefficient monomial. There are finitely many partition pairs and tree orbits, which proves (16).

Exponentiation on a primitive ray

Proof of Theorem 1.2. Fix relatively prime positive integers d,ed,e. For each r≥1r\geq1, define the polynomial

ur=rHrd,rebc∈Q[b,c].u_r=\frac{rH_{rd,re}}{bc}\in\mathbb{Q}[b,c].

Proposition 4.2 gives (rmax⁡(d,e))!ur∈Z[b,c](r\max(d,e))!u_r\in\mathbb{Z}[b,c]. For a fixed positive integer kk, the coefficient of tkt^k in (6) is

τ(kd,ke)=∑m1,…,mk≥0∑r=1krmr=kg∑r=1kmr∏r=1kurmrmr!.(20)\tau(kd,ke)=\sum_{\substack{m_1,\ldots,m_k\geq0\\ \sum_{r=1}^{k}rm_r=k}}g^{\sum_{r=1}^{k}m_r}\prod_{r=1}^{k}\frac{u_r^{m_r}}{m_r!}. \tag*{(20)}

The integer mrm_r here records the number of times the term urtru_rt^r is chosen in the exponential expansion. For every tuple in this finite sum,

(kmax⁡(d,e))!∏r=1k((rmax⁡(d,e))!)mrmr!∈Z.(21)\frac{(k\max(d,e))!}{\prod_{r=1}^{k}((r\max(d,e))!)^{m_r}m_r!}\in\mathbb{Z}. \tag*{(21)}

This quotient counts partitions of a labelled kmax⁡(d,e)k\max(d,e)-element set into mrm_r unordered blocks of size rmax⁡(d,e)r\max(d,e), for 1≤r≤k1\leq r\leq k. The block sizes are distinct because max⁡(d,e)≥1\max(d,e)\geq1. After multiplication by (kmax⁡(d,e))!(k\max(d,e))!, each summand of (20) becomes

(kmax⁡(d,e))!∏r=1k(rmax⁡(d,e))!mrmr! g∑r=1kmr∏r=1k((rmax⁡(d,e))!ur)mr\frac{(k\max(d,e))!}{\prod_{r=1}^{k}(r\max(d,e))!^{m_r}m_r!}\,g^{\sum_{r=1}^{k}m_r}\prod_{r=1}^{k}\left((r\max(d,e))!u_r\right)^{m_r}

The first factor is an integer by (21), and each remaining factor belongs to Z[b,c,g]\mathbb{Z}[b,c,g]. Hence (kmax⁡(d,e))!τ(kd,ke)∈Z[b,c,g](k\max(d,e))!\tau(kd,ke)\in\mathbb{Z}[b,c,g]. Every (i,j)(i,j) equals (kd,ke)(kd,ke) for such a primitive (d,e)(d,e), and kmax⁡(d,e)=max⁡(i,j)k\max(d,e)=\max(i,j).

Example 5.1. The first coefficients illustrate the normalization:

H1,1=bc,H1,2=bc(b−1)2,H2,1=bc(c−1)2.H_{1,1}=bc,\qquad H_{1,2}=\frac{bc(b-1)}{2},\qquad H_{2,1}=\frac{bc(c-1)}{2}.

For (1,2)(1,2), the partition μ=(2)\mu=(2) contributes −bc/2-bc/2. For μ=(1,1)\mu=(1,1) and λ=(1)\lambda=(1) the only underlying tree has both sources adjacent to the sink and contributes b2c/2b^2c/2. Therefore

τ(1,1)=g,τ(1,2)=g(b−1)2,τ(2,1)=g(c−1)2.\tau(1,1)=g,\qquad\tau(1,2)=\frac{g(b-1)}{2},\qquad\tau(2,1)=\frac{g(c-1)}{2}.

The two-vertex term at (i,j)=(2,2)(i,j)=(2,2) contributes bc/4bc/4 to H2,2H_{2,2}. The ray multiplicity k=2k=2 in (5) changes its contribution to [g]τ(2,2)[g]\tau(2,2) to 1/21/2, which is cleared by 2!2!.

Zhili College, Tsinghua University, Beijing 100084, China

Email address: [email protected]

References

  1. [1]R. Akagi, Explicit forms in lower degrees of rank 2 cluster scattering diagrams, Algebra. Comb. 8 (2025), no. 4, 1021–1067. doi:10.5802/alco.432.DOI
  2. [2]R. Akagi, Some coefficients of rank 2 cluster scattering diagrams, arXiv:2507.21916v3, 2025.arxiv.org/abs/2507.21916
  3. [3]A. Burcroff, K. Lee, and L. Mou, Scattering diagrams, tight gradings, and generalized positivity, Proc. Natl. Acad. Sci. USA 122 (2025), no. 18, e2422893122. arXiv:2409.15235.arxiv.org/abs/2409.15235
  4. [4]A. Burcroff, K. Lee, and L. Mou, Positivity of generalized cluster scattering diagrams, arXiv:2503.03719v1, 2025.arxiv.org/abs/2503.03719
  5. [5]A. Burcroff, K. Lee, L. Mou, G. Musiker, and M. Reineke, Cluster scattering diagrams via quiver moduli and tight gradings, J. Lond. Math. Soc. 114 (2026), no. 2, e70642. doi:10.1112/jlms.70642. Preprint arXiv:2511.14672v1 (2025). The proposition numbering used here is that of the preprint.DOI
  6. [6]T. Elgin, N. Reading, and S. Stella, Cluster scattering coefficients in rank 2, Arnold Math. J. 12 (2026), no. 1, 111–122. doi:10.56994/ARMJ.012.001.003. Preprint arXiv:2404.11381v4 (2025); first version 2024.DOI
  7. [7]S. Fomin and A. Zelevinsky, Cluster algebras I: Foundations, J. Amer. Math. Soc. 15 (2002), no. 2, 497–529.DOI
  8. [8]M. Gross, P. Hacking, S. Keel, and M. Kontsevich, Canonical bases for cluster algebras, J. Amer. Math. Soc. 31 (2018), no. 2, 497–608. arXiv:1411.1394.
  9. [9]M. Gross and R. Pandharipande, Quivers, curves, and the tropical vertex, Port. Math. 67 (2010), no. 2, 211–259.arxiv.org/abs/0909.5153
  10. [10]M. Gross, R. Pandharipande, and B. Siebert, The tropical vertex, Duke Math. J. 153 (2010), no. 2, 297–362.DOI
  11. [11]M. Gross and B. Siebert, From real affine geometry to complex geometry, Ann. of Math. 174 (2011), no. 3, 1301–1428.arxiv.org/abs/math/0703822
  12. [12]H. Ju, G. Gao, J. Jiang, B. Wu, Z. Sun, S. Liu, L. Chen, Yutong Wang, Yuefeng Wang, Z. Wang, W. He, P. Wu, L. Xiao, R. Liu, B. Dai, and B. Dong, Automated conjecture resolution with formal verification, arXiv:2604.03789v2, 2026.arxiv.org/abs/2604.03789
  13. [13]M. Kontsevich and Y. Soibelman, Affine structures and non-Archimedean analytic spaces, in The Unity of Mathematics, Progr. Math. 244, Birkhäuser, Boston, 2006, 321–385.DOI
  14. [14]S. Liu, Rethlas-OSV: Desktop math agents for mathematicians, 2026, updated October 20, 2026; official guide.
  15. [15]S. Mozgovoy and M. Reineke, Abelian quiver invariants and marginal wall-crossing, Lett. Math. Phys. 104 (2014), 495–525. doi:10.1007/s11005-013-0671-0. Preprint arXiv:1212.0410v1 (2012). The theorem and equation numbers used here refer to this preprint.DOI
  16. [16]F. Nie, H. Ye, S. Liu, Z. Wang, S. Ermon, and J. Zou, One-sided verification under limited expert review, arXiv:2610.18089v2, 2026.arxiv.org/abs/2610.18089

Paper details

vlnc:W_tmwh24sn
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 11

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

GPT-6-Astra, Codex · View statement →

Looking for related papers…
Contents