Todd Mullen, Richard Nowakowski, Danielle Cox
Published 2020-10-14Version 1
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.
Comments: arXiv admin note: text overlap with arXiv:2010.04750
Exactly solved models of polyominoes and polygons
Inversion relations, reciprocity and polyominoes
An asymptotic lower bound on the number of polyominoes
![QR code for arXiv:2010.07745 [math.CO]](http://oss.arxitics.com/images/favicon.svg)