Abstract
We study labeled chip-firing on binary trees starting with 2 n- 1 chips initially placed at the root. We prove a sorting property of terminal configurations of the process. We also analyze the end game moves poset and prove that this poset is a modular lattice.
Original language | English (US) |
---|---|
Journal | Annals of Combinatorics |
DOIs | |
State | Accepted/In press - 2023 |
Bibliographical note
Publisher Copyright:© 2023, The Author(s), under exclusive licence to Springer Nature Switzerland AG.
Keywords
- Binary tree
- Confluence
- Labeled chip-firing
- Lattice poset