Search arXivSearch

arXiv · 2311.07078

The Distribution of Sandpile Groups of Random Graphs with their Pairings

Abstract

We determine the distribution of the sandpile group (also known as the Jacobian) of the Erdős-Rényi random graph $G(n,q)$ along with its canonical duality pairing as $n$ tends to infinity, fully resolving a conjecture from 2015 due to Clancy, Leake, and Payne and generalizing the result by Wood on the groups. In particular, we show that a finite abelian $p$-group $G$ equipped with a perfect symmetric pairing $δ$ appears as the Sylow $p$-part of the sandpile group and its pairing with frequency inversely proportional to $|G||\mathrm{Aut}(G,δ)|$, where $\mathrm{Aut}(G,δ)$ is the set of automorphisms of $G$ preserving the pairing $δ$. While this distribution is related to the Cohen-Lenstra distribution, the two distributions are not the same on account of the additional algebraic data of the pairing. The proof utilizes the moment method: we first compute a complete set of moments for our random variable (the average number of epimorphisms from our random object to a fixed object in the category of interest) and then show the moments determine the distribution. To obtain the moments, we prove a universality result for the moments of cokernels of random symmetric integral matrices whose dual groups are equipped with symmetric pairings that is strong enough to handle both the dependence in the diagonal entries and the additional data of the pairing. We then apply results due to Sawin and Wood to show that these moments determine a unique distribution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eliot Hodges. 2023-11-13. The Distribution of Sandpile Groups of Random Graphs with their Pairings. https://arxiv.org/abs/2311.07078

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