Compatible recurrent identities of the sandpile group and maximal stable configurations

DOI10.1016/j.dam.2020.08.028zbMath1451.05172arXiv2008.10079OpenAlexW3080859995MaRDI QIDQ2208354

Rupert Li, Yibo Gao

Publication date: 2 November 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

treebipartite graphsandpile groupchip-firingmaximal stable configurationrecurrent identity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chip-firing games on directed graphs
• Chip-firing games on graphs
• The sandpile group of a tree
• The probabilistic abacus
• Why does the probabilistic abacus work?
• Chip-firing and the critical group of a graph
• On the sandpile group of dual graphs
• On the identity of the sandpile group
• Algorithmic Aspects of a Chip-Firing Game
• Chip-Firing and Rotor-Routing on Directed Graphs
• Polynomial Bound for a Chip Firing Game on Graphs
• Algebraic Potential Theory on Graphs
• Self-organized critical state of sandpile automaton models
• Algebraic Combinatorics
• Algebraic aspects of Abelian sandpile models
• Explicit characterization of the identity configuration in an Abelian sandpile model

This page was built for publication: Compatible recurrent identities of the sandpile group and maximal stable configurations