- The paper constructs large families of distinct probability distributions on partitions with identical moments, including a 2^{r-1}-parameter family for every strict partition of length r.
- Hall–Littlewood symmetric functions and basic hypergeometric identities yield explicit moment formulas, prove moment bounds, and extend calculations for Cohen–Lenstra, Malle, and Garton-type distributions.
- Numerical evidence supports the conjectured bipartite-graph threshold α=1/p, while the p=2 limit and the behavior of expected p-ranks near this threshold remain open problems.
Overview
This paper by Fulman, Kaplan, Singhal, and Warnaar studies the distribution of Sylow p-subgroups of sandpile groups of random bipartite graphs and, more broadly, constructs large families of distinct distributions on partitions that share the same moments. The work sits at the intersection of the method-of-moments program for finite abelian p-groups initiated by Wood [2017], the combinatorics of Hall–Littlewood symmetric functions, and the theory of basic hypergeometric series.
The central observation is a moment-degeneracy phenomenon: while Wood's universality theorem guarantees that moments bounded by pn(μ) determine a unique measure on partitions, several natural distributions arising from random graph sandpile groups have larger moments, and the paper shows these moments fail to be injective in a structured way. Specifically, two distributions—one conjectured for Sylow 2-subgroups of sandpile groups of random bipartite graphs, and one proved by Mészáros for even-degree random regular graphs—are different yet have identical moments.
Background: sandpile groups and moment methods
For a connected graph Γ, the sandpile group SΓ is the cokernel of the reduced Laplacian; its order counts spanning trees by Kirchhoff's theorem. Wood proved that for Erdős–Rényi random graphs G(n,u), the Sylow p-subgroups (SG(n,u))p converge in distribution to the measure P∞,pSym arising as the cokernel distribution of Haar-random symmetric matrices over Zp, whose p0-moment is exactly p1. Mészáros extended this to random p2-regular graphs, observing an anomaly when p3 is even and p4: the limiting 2-Sylow distribution has odd rank always, with probabilities p5 on partitions of odd length, and its p6-moments equal p7—exceeding Wood's uniqueness threshold.
The paper's bipartite analogue concerns p8 with fixed p9. Koplewitz's result on expected pn(μ)0-ranks establishes a sharp threshold: for pn(μ)1 all limiting probabilities vanish, while for pn(μ)2 the paper conjectures (Conjecture 1.1) convergence to pn(μ)3 for odd pn(μ)4 and to pn(μ)5 for pn(μ)6. A proof for odd primes appears in forthcoming work of the third author; the pn(μ)7 case remains open here.
Families of distributions with identical moments
The main structural contribution is a general construction. For any partition pn(μ)8 of length pn(μ)9, define Γ0, and for subsets Γ1 introduce signed variants multiplying by Γ2. The key theorem states:
- The Γ3-moments of Γ4 are bounded by Γ5, so they exceed Wood's threshold whenever Γ6.
- If Γ7 is strict, then for every odd-cardinality subset Γ8, the measures Γ9 and SΓ0 have identical SΓ1-moments for all SΓ2.
Fixing a strict SΓ3 of length SΓ4 thus yields SΓ5 distinct measures with common moments, and affine combinations parametrized by a polytope SΓ6—shown to be a SΓ7-dimensional cube via a Hadamard-type orthogonality argument—give a full SΓ8-parameter family of probability distributions sharing those moments, with injectivity of the parametrization established.
The case SΓ9 is highlighted: for each positive integer G(n,u)0 there is a one-parameter family G(n,u)1, G(n,u)2, all having G(n,u)3-moments G(n,u)4. The Mészáros even-G(n,u)5, G(n,u)6 distribution is the instance G(n,u)7, while the conjectural bipartite G(n,u)8 limit is G(n,u)9—two genuinely different distributions with the same moments. This connects to Poonen–Rains heuristics for p0-Selmer ranks of elliptic curves: the rank distribution under p1 matches their conjecture, and Wood's ICM results show any measure with the corresponding rank moments agrees with some member of the family on ranks.
Moment computations via Hall–Littlewood theory
The technical engine is a transition-probability factorization. Writing p2 for explicit Markov transition weights, the identity p3 reduces moment sums to iterated applications of p4-hypergeometric summations, notably a terminating p5 transformation and the Rogers–Szegő evaluation at p6. Moments of p7 are expressed through a Srivastava–Daoust type multiple series p8, whose evaluation yields both the moment bounds and the equality of moments across the family (the latter following from the vanishing of alternating sums p9).
The same machinery reproves Fulman–Kaplan's closed form for moments of the Cohen–Lenstra distributions (SG(n,u))p0 (moments (SG(n,u))p1), and computes moments for two generalizations tied to class group heuristics in the presence of roots of unity:
- A Malle/Lipnowski–Sawin–Tsimerman type family (SG(n,u))p2, with moments (SG(n,u))p3, valid for real (SG(n,u))p4 and non-prime (SG(n,u))p5.
- A Garton type family (SG(n,u))p6, with moments (SG(n,u))p7, extending results previously known only for integer parameters.
These computations hold for arbitrary real (SG(n,u))p8, where surjection counts are defined algebraically through Hall–Littlewood skew functions via the Nguyen–Van Peski formula.
Numerical evidence
Simulations in Sage ((SG(n,u))p9, 500 samples per parameter pair) support Conjecture 1.1. For both P∞,pSym0 and P∞,pSym1, empirical frequencies of P∞,pSym2 closely match the predicted distributions once P∞,pSym3, while data at P∞,pSym4 deviates sharply, exhibiting heavier rank tails consistent with Koplewitz's linear growth of expected rank below the threshold. Rank-distribution experiments show the same threshold behavior.
A notable tension emerges in the expected values of P∞,pSym5: the conjectures imply limits of P∞,pSym6 (odd P∞,pSym7) and P∞,pSym8 (P∞,pSym9). Empirically, expectations are near these values for Zp0 comfortably above Zp1, but at Zp2 for Zp3 the observed value was about Zp4, driven by two outlier graphs of ranks 12 and 9; excluding five outliers brings it to roughly Zp5. The authors explicitly concede that the conjectured limits may fail near the threshold and may only hold for Zp6 with some Zp7—an open question the data raises but does not resolve.
Limitations and open questions
Several caveats bound the results. The bipartite conjecture itself is unproven in the paper for all primes: odd Zp8 is deferred to separate forthcoming work, and Zp9 remains entirely conjectural, supported only by computation. The numerical experiments use p00 with 500 samples, so agreement near the p01 threshold—where expected ranks grow polynomially and outliers dominate empirical means—is weak evidence. The moment-equality construction requires p02 strict; whether analogous degeneracies exist for general p03 is not addressed. Finally, the paper deliberately excludes questions of pairings on sandpile groups and joint distributions across multiple primes, and the relationship between the moment families constructed here and the general uniqueness criteria of Sawin–Wood is left implicit rather than developed.
Conclusion
The paper identifies a concrete moment-degeneracy phenomenon for distributions on finite abelian p04-groups, embeds the p05 anomalies for random regular and bipartite graph sandpile groups into a unified p06-parameter family, and supplies a Hall–Littlewood/hypergeometric toolkit that computes moments for a range of Cohen–Lenstra-type distributions beyond the prime setting. Its main open problems—the p07 bipartite conjecture and the behavior of expected p08-ranks near the p09 threshold—define the immediate boundary of what is currently established.