Let me begin with labeled chip-firing on an infinite directed binary tree, where the root is at the top. Place 2n chips, labeled from 0 to 2n − 1, at the root. A move consists of choosing any two chips at the same vertex and firing them: the smaller chip goes to the left child, and the larger chip goes to the right child. For k ≥ 2, the k-a...
Following Tanya Khovanova's Math Blog's news feed is very easy. Subscribe using the "follow" button on the top right and if you want to, choose the updates by topic or tag.
We will deliver them to your inbox, your phone, or you can use follow.it like your own online RSS reader. You can unsubscribe whenever you want with one click.
Keep up to date with Tanya Khovanova's Math Blog!
Tanya Khovanova's Math Blog: Tanya Khovanova's Math Blog