Labeled Chip-firing on Binary Trees with $2^n-1$ Chips
Combinatorics
2023-11-15 v3
Abstract
We study labeled chip-firing on binary trees and some of its modifications. We prove a sorting property of terminal configurations of the process. We also analyze the endgame moves poset and prove that this poset is a modular lattice.
Keywords
Cite
@article{arxiv.2206.02007,
title = {Labeled Chip-firing on Binary Trees with $2^n-1$ Chips},
author = {Gregg Musiker and Son Nguyen},
journal= {arXiv preprint arXiv:2206.02007},
year = {2023}
}
Comments
Updated version to appear in Annals of Combinatorics