Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.02667 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910685463576576 |
|---|---|
| author | Alofi, Amal Dukes, Mark |
| author_facet | Alofi, Amal Dukes, Mark |
| contents | The lacking polynomial is a graph polynomial introduced by Chan, Marckert, and Selig in 2013 that is closely related to the Tutte polynomial of a graph. It arose by way of a generalization of the Abelian sandpile model and is essentially the generating function of the level statistic on the set of recurrent configurations, called stochastically recurrent states, for that model. In this note we consider the lacking polynomial of the complete bipartite graph. We classify the stochastically recurrent states of the stochastic sandpile model on the complete bipartite graphs $K_{2,n}$ and $K_{m,2}$ where the sink is always an element of the set counted by the first index. We use these characterizations to give explicit formulae for the lacking polynomials of these graphs. Log-concavity of the sequence of coefficients of these two lacking polynomials is proven, and we conjecture log-concavity holds for this general class of graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_02667 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A note on the lacking polynomial of the complete bipartite graph Alofi, Amal Dukes, Mark Combinatorics The lacking polynomial is a graph polynomial introduced by Chan, Marckert, and Selig in 2013 that is closely related to the Tutte polynomial of a graph. It arose by way of a generalization of the Abelian sandpile model and is essentially the generating function of the level statistic on the set of recurrent configurations, called stochastically recurrent states, for that model. In this note we consider the lacking polynomial of the complete bipartite graph. We classify the stochastically recurrent states of the stochastic sandpile model on the complete bipartite graphs $K_{2,n}$ and $K_{m,2}$ where the sink is always an element of the set counted by the first index. We use these characterizations to give explicit formulae for the lacking polynomials of these graphs. Log-concavity of the sequence of coefficients of these two lacking polynomials is proven, and we conjecture log-concavity holds for this general class of graphs. |
| title | A note on the lacking polynomial of the complete bipartite graph |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2411.02667 |