Labeled Chip-firing on Binary Trees with $2^n-1$ Chips

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.

Updated version to appear in Annals of Combinatorics