Skip to Main content Skip to Navigation
Conference papers

Minimal Recurrent Configurations of Chip Firing Games and Directed Acyclic Graphs

Abstract : 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.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01185492
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 20, 2015 - 2:16:25 PM
Last modification on : Wednesday, October 4, 2017 - 5:46:04 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:55:39 AM

File

dmAL0108.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01185492, version 1

Collections

Citation

Matthias Schulz. Minimal Recurrent Configurations of Chip Firing Games and Directed Acyclic Graphs. Automata 2010 - 16th Intl. Workshop on CA and DCS, 2010, Nancy, France. pp.111-124. ⟨hal-01185492⟩

Share

Metrics

Record views

178

Files downloads

673