← ALB News · curated headline

Labeled Chip-Firing on Ordered Directed Graphs

arXiv Mathematics · WORLD · Mathematics · 11/20/2026, 12:00:00 AM

arXiv:2611.25137v1 Announce Type: new Abstract: We study labeled chip-firing on rooted directed graphs where for each vertex $v$, the children of $v$ are linearly ordered. When a vertex fires, the selected chips are sent to its children in increasing order. We show that homomorphisms preserving these child choices transport legal firing sequences. We then consider the directed lattice $\mathbb Z_{\geq0}^2$ and ask which chips can reach a given vertex. We give a recurrence for the smallest reachable label when sufficiently many chips are present and show that consecutive pairing attains this minimum. Finally, we determine the largest reachable label by symmetry and prove that the reachable labels form an interval when the number of initial chips is sufficiently large.

Continue to arXiv Mathematics →

You are being forwarded in 6s — stay on this page