Minimal Recurrent Configurations of Chip Firing Games and Directed Acyclic Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2010

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.
Fichier principal
Vignette du fichier
dmAL0108.pdf (348.45 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01185492 , version 1 (20-08-2015)

Identifiers

Cite

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, ⟨10.46298/dmtcs.2756⟩. ⟨hal-01185492⟩

Collections

INSMI TDS-MACS
142 View
540 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More