Coding Distributive Lattices with Edge Firing Games
<|reference_start|>Coding Distributive Lattices with Edge Firing Games: 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 concepts are equivalent.<|reference_end|>
@article{latapy2001coding,
    title={Coding Distributive Lattices with Edge Firing Games},
    author={Matthieu Latapy (LIAFA), Clemence Magnien (LIAFA)},
    journal={arXiv preprint arXiv:math/0110214},
    year={2001},
    archivePrefix={arXiv},
    eprint={math/0110214},
    primaryClass={math.CO cs.IT math-ph math.DS math.IT math.MP}
}