Chip-Firing and Fractional Bases

2018/09/25 by Borodin, Matvey, Han, Hannah, Ji, Kaylee +8
#05C99 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1809.09676

Abstract

We study a particular chip-firing process on an infinite path graph. At any time when there are at least a+b chips at a vertex, a chips fire to the left and b chips fire to the right. We describe the final state of this process when we start with n chips at the origin.

Related

• On Chip-Firing on Undirected Binary Trees
• Chip Firing on Directed k-ary Trees
• Labeled Chip-firing on Binary Trees with 2ⁿ-1 Chips
• Chip-Firing on Infinite k-ary Trees
• Labeled Chip-Firing on Directed k-ary Trees and Where Chips Land