 |
Discrete Mathematics & Theoretical Computer Science |
Matthias Schulz - Minimal Recurrent Configurations of Chip Firing Games and Directed Acyclic Graphs
dmtcs:2756 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, DMTCS Proceedings vol. AL, Automata 2010 - 16th Intl. Workshop on CA and DCS - https://doi.org/10.46298/dmtcs.2756Minimal Recurrent Configurations of Chip Firing Games and Directed Acyclic GraphsArticle
- 1 Karlsruhe Institute of Technology
- 2 Karlsruhe Institute of Technology = Karlsruher Institut für Technologie [KIT]
We discuss a very close relation between minimal recurrent configurations of Chip Firing Games and Directed Acyclic Graphs and demonstrate the usefulness of this relation by giving a lower bound for the number of minimal recurrent configurations of the Abelian Sandpile Model as well as a lower bound for the number of firings which are caused by the addition of two recurrent configurations on particular graphs.
Source: HAL:hal-01185492v1
Volume: DMTCS Proceedings vol. AL, Automata 2010 - 16th Intl. Workshop on CA and DCS
Section: Proceedings
Published on: January 1, 2010
Imported on: January 31, 2017
Keywords: Chip Firing Games,Sandpile Model,Minimal Recurrent Configurations,DAGs,Addition of Recurrent Configurations,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS],[NLIN.NLIN-CG] Nonlinear Sciences [physics]/Cellular Automata and Lattice Gases [nlin.CG],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]
2 Documents citing this article
Consultation statistics
This page has been seen 249 times.
This article's PDF has been downloaded 294 times.