2001/10/19 by Matthieu Latapy, Latapy, Matthieu, Clémence Magnien +2
Computer Science · Decision Sciences · Economics, Econometrics and Finance · Mathematics · Physics and Astronomy · #Combinatorics (math.CO) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Game Theory and Applications #Game Theory and Voting Systems #Information Theory (cs.IT) #Logic, Reasoning, and Knowledge #Mathematical Physics (math-ph) #cs.IT #math-ph #math.CO #math.DS #math.IT #math.MP
paper · pdf · doi:10.48550/arxiv.math/0110214
4 pages, 2 figures
arxiv created 2001/10/19 · openalex publication_date 2001/10/19 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.