arXiv Analytics

Sign in

arXiv:2206.02007 [math.CO]AbstractReferencesReviewsResources

Labeled Chip-firing on Binary Trees

Gregg Musiker, Son Nguyen

Published 2022-06-04Version 1

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.

Comments: 26 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1006.5280 [math.CO] (Published 2010-06-28)
Slim Sets of Binary Trees
arXiv:2309.06149 [math.CO] (Published 2023-09-12)
Two involutions on binary trees and generalizations
arXiv:math/0304132 [math.CO] (Published 2003-04-09)
Supersolvable LL-lattices of binary trees

Links

Toolbox