In this note, we show that any distributive lattice is isomorphic to the set of reachable configurations of an Edge Firing Game. Together with the result of James Propp, saying that the set of reachable configurations of any Edge Firing Game is always a distributive lattice, this shows that the two
Characterization of simple edge-firing games
β Scribed by Oliver Pretzel
- Book ID
- 104136808
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 31 KB
- Volume
- 84
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
β¦ Synopsis
In a recent publication, Latapy and Magnien [Inform. Process. Lett. 83 (2002) 125-128] show how every distributive lattice can be represented as the set of configurations of a simple edge firing game (EFG). This is a converse of the result of Propp [Preprint, 1993] that shows that the set of configurations of an EFG forms a distributive lattice. Using this result and then the result of Latapy and Magnien gives an algorithm for converting an arbitrary EFG to a simple one with isomorphic state space.
The purpose of this note is to provide a characterization of simple edge firing games. The characterization will emerge from a more general result which determines how often a particular vertex can be fired in such a game.
π SIMILAR VOLUMES
(Warning: Language and sexual content. 16+) Sophie has enough problems in her life without Spencer turning her blood to fire, without his eyes freezing and burning her, without his hatred of her. Since his migration into the house next to hers, Sophia Valdez isnβt sure whether she wants to toss