Complete Graphs and Polyominoes

Abstract

In the chip-firing variant, Diffusion, chips flow from places of high concentration to places of low concentration (or equivalently, from the rich to the poor). We explore this model on complete graphs, determining the number of different ways that chips can be distributed on an unlabelled complete graph and demonstrate connections to polyominoes.

arXiv commentarXiv admin note: text overlap with arXiv:2010.04750

References in corpus (2)

• A Variation on Chip-Firing: the diffusion game
• Uniform Bounds for Non-negativity of the Diffusion Game