Labeled Chip-Firing on Star Graphs
Abstract
We study the stable configurations of the labeled chip-firing game on an infinitely subdivided k-star graph starting with km chips on the center vertex. We prove a sorting property of this game and analyze special stable configurations corresponding to standard Young tableaux.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.