Labeled Chip-firing on Binary Trees with 2ⁿ-1 Chips

2022/06/04 by Musiker, Gregg, Nguyen, Son · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2206.02007

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.

Cited by

• Labeled Chip-Firing on Undirected k-ary Trees
• Labeled Chip-Firing on Directed k-ary Trees and Where Chips Land

Related

• On Chip-Firing on Undirected Binary Trees
• Labeled Chip-Firing on Directed k-ary Trees and Where Chips Land
• Lattices in Chip-Firing
• Labeled Chip-Firing on Undirected k-ary Trees
• Chip Firing on Directed k-ary Trees