Sandpile group distribution conjecture for random directed graphs

Let Γ(n)\Gamma(n) be a sequence of ϵ\epsilon-balanced random digraphs, and let S(Γ(n))S(\Gamma(n)) denote its total sandpile group. Let GG be a finite abelian group, and define

Q=p primek=2(1pk).Q=\prod_{p\text{ prime}}\prod_{k=2}^{\infty}(1-p^{-k}).

Sandpile group distribution conjecture. For every finite abelian group GG,

limnP(S(Γ(n))=G)=QGAut(G).\lim_{n\rightarrow\infty}{\mathbb P}(S(\Gamma(n))=G)=\frac{Q}{|G||\operatorname{Aut}(G)|}.

The preceding results establish convergence for every fixed finite set of prime-primary components, but do not control the entire sandpile group; the conjecture asserts that these restrictions are unnecessary. If true, it would also imply that the probability of being coeulerian converges to QQ.

Sources & referencesView supporting material

Primary source

Shaked Koplewitz, “Sandpile groups and the coeulerian property for random directed graphs”, arXiv:1611.06444 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.