On the sandpile group of regular trees

Abstract

The sandpile group of a connected graph is the group of recurrent configurations in the abelian sandpile model on this graph. We study the structure of this group for the case of regular trees. A description of this group is the following: Let T(d,h) be the d-regular tree of depth h and let V be the set of its vertices. Denote the adjacency matrix of T(d,h) by A and consider the modified Laplacian matrix D:=dI-A. Let the rows of D span the lattice L in ZV. The sandpile group of T(d,h) is ZV/L. We compute the rank, the exponent and the order of this abelian group and find a cyclic Hall-subgroup of order (d-1)h. We find that the base (d-1)-logarithm of the exponent and of the order are asymptotically 3h2/pi2 and cd(d-1)h, respectively. We conjecture an explicit formula for the ranks of all Sylow subgroups.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…