Complete Graphs and Polyominoes
Combinatorics
2020-10-16 v1
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.
Keywords
Cite
@article{arxiv.2010.07745,
title = {Complete Graphs and Polyominoes},
author = {Todd Mullen and Richard Nowakowski and Danielle Cox},
journal= {arXiv preprint arXiv:2010.07745},
year = {2020}
}
Comments
arXiv admin note: text overlap with arXiv:2010.04750