On the sandpile group of regular trees

DOI10.1016/J.EJC.2005.11.003zbMATH Open1120.05042arXivmath/0403219OpenAlexW2021316688MaRDI QIDQ872040FDOQ872040

Evelin Toumpakari

Publication date: 27 March 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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 Z^V. The sandpile group of T(d,h) is Z^V/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 3h^2/pi^2 and c_d(d-1)^h, respectively. We conjecture an explicit formula for the ranks of all Sylow subgroups.

Full work available at URL: https://arxiv.org/abs/math/0403219

Recommendations

• The sandpile group of a bilateral regular tree
• The sandpile group of a tree
• On the sandpile group of a family of graphs
• Sandpile groups and spanning trees of directed line graphs
• On the identity of the sandpile group
• On the sandpile group of the cone of a graph
• The distribution of sandpile groups of random regular graphs
• The sandpile group of a family of nearly complete graphs
• On the set of critical exponents of discrete groups acting on regular trees
• The sandpile groups of chain-cyclic graphs

zbMATH Keywords

rankrecurrent configurationsandpile groupabelian sandpile modelregular treeHall-subgroup

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Algebraic combinatorics (05E99)

Cites Work

• Chip-firing and the critical group of a graph
• On the sandpile group of dual graphs
• Self-organized criticality
• Self-organized critical state of sandpile automaton models
• Algebraic aspects of Abelian sandpile models
• Chip-firing games on graphs
• Chip-firing games on directed graphs
• On theories with a combinatorial definition of 'equivalence'
• Title not available (Why is that?)
• Algebraic Potential Theory on Graphs
• Asymmetric Abelian sandpile models
• The computational complexity of sandpiles
• On the critical group of the \(n\)-cube
• Sandpile group on the graph \(\mathcal D_n\) of the dihedral group
• Critical groups for complete multipartite graphs and Cartesian products of complete graphs
• Polynomial Bound for a Chip Firing Game on Graphs
• No Polynomial Bound for the Chip Firing Game on Directed Graphs
• Algorithmic aspects of a chip-firing game

Cited In (17)

• Random Walks, Electric Networks and The Transience Class problem of Sandpiles
• On the complexity of sandpile critical avalanches
• Smith normal form and Laplacians
• On the sandpile group of Eulerian series-parallel graphs
• The sandpile group of a tree
• On the sandpile group of the graph \(K_{3}\times C_n\)
• On graph parameters guaranteeing fast sandpile diffusion
• The sandpile group of polygon rings and twisted polygon rings
• The sandpile group of a polygon flower
• On the sandpile group of the cone of a graph
• On the sandpile model of modified wheels. II
• The abelian sandpile model on randomly rooted graphs and self-similar groups
• Directed nonabelian sandpile models on trees
• On the complexity of sandpile prediction problems
• The sandpile group of a thick cycle graph
• The Complexity of Three-Dimensional Critical Avalanches
• Abelian sandpiles on Sierpiński gasket graphs

This page was built for publication: On the sandpile group of regular trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872040)