On the sandpile group of regular trees

DOI10.1016/j.ejc.2005.11.003zbMath1120.05042arXivmath/0403219OpenAlexW2021316688MaRDI QIDQ872040

Evelin Toumpakari

Publication date: 27 March 2007

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

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

zbMATH Keywords

rankregular treerecurrent configurationsandpile groupabelian sandpile modelHall-subgroup

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Chip-firing games on directed graphs
• Chip-firing games on graphs
• Asymmetric Abelian sandpile models
• Chip-firing and the critical group of a graph
• 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
• On the sandpile group of dual graphs
• On theories with a combinatorial definition of 'equivalence'
• Algorithmic Aspects of a Chip-Firing Game
• Self-organized criticality
• Polynomial Bound for a Chip Firing Game on Graphs
• No Polynomial Bound for the Chip Firing Game on Directed Graphs
• Algebraic Potential Theory on Graphs
• Critical groups for complete multipartite graphs and Cartesian products of complete graphs
• Self-organized critical state of sandpile automaton models
• Algebraic aspects of Abelian sandpile models