An exact bound on the number of chips of parallel chip-firing games that stabilize

DOI10.1007/s00013-022-01777-3zbMath1500.05042OpenAlexW4296965584MaRDI QIDQ2085558

Yunseo Choi, Alan Bu, Max Wenqiang Xu

Publication date: 18 October 2022

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00013-022-01777-3

zbMATH Keywords

chip-firing gameparallel chip-firing game

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Dynamical aspects of cellular automata (37B15) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• A constant bound for the periods of parallel chip-firing games with many chips
• Chip-firing games on graphs
• Balancing vectors in the max norm
• Parallel chip firing games on graphs
• No polynomial bound for the period of the parallel chip firing game on graphs
• Parallel chip-firing on the complete graph: Devil’s staircase and Poincaré rotation number
• Polynomial Bound for a Chip Firing Game on Graphs

This page was built for publication: An exact bound on the number of chips of parallel chip-firing games that stabilize