arXiv Analytics

Sign in

arXiv:math/0110211 [math.CO]AbstractReferencesReviewsResources

Characterisation of lattices induced by (extended) Chip Firing Games

Clemence Magnien, Ha Duong Phan, Laurent Vuillon

Published 2001-10-19Version 1

The Chip Firing Game (CFG) is a discrete dynamical model used in physics, computer science and economics. It is known that the set of configurations reachable from an initial configuration (this set is called the configuration space) can be ordered as a lattice. We first present a structural result about this model, which allows us to introduce some useful tools for describing those lattices. Then we establish that the class of lattices that are the configuration space of a CFG is strictly between the class of distributive lattices and the class of upper locally distributive (or ULD) lattices. Finally we propose an extension of the model, the coloured Chip Firing Game, which generates exactly the class of ULD lattices.

Comments: See also http://www.liafa.jussieu.fr/~magnien
Journal: DM-TCS (AA) 2001 229-244
Categories: math.CO, math.DS
Related articles: Most relevant | Search more
arXiv:math/0002062 [math.CO] (Published 2000-02-09)
A characterisation of Pfaffian near bipartite graphs
arXiv:2110.07257 [math.CO] (Published 2021-10-14, updated 2023-11-07)
$P$-associahedra
arXiv:1310.5779 [math.CO] (Published 2013-10-22, updated 2014-03-01)
A Characterisation of Weak Integer Additive Set-Indexers of Graphs