Combinatorial aspects of sandpile models on wheel and fan graphs
arXiv:2202.06487 · doi:10.1016/j.ejc.2022.103663
Abstract
We study combinatorial aspects of the sandpile model on wheel and fan graphs, seeking bijective characterisations of the model's recurrent configurations on these families. For wheel graphs, we exhibit a bijection between these recurrent configurations and the set of subgraphs of the cycle graph which maps the level of the configuration to the number of edges of the subgraph. This bijection relies on two key ingredients. The first consists in considering a stochastic variant of the standard Abelian sandpile model (ASM), rather than the ASM itself. The second ingredient is a mapping from a given recurrent state to a canonical minimal recurrent state, exploiting similar ideas to previous studies of the ASM on complete bipartite graphs and Ferrers graphs. We also show that on the wheel graph with vertices, the number of recurrent states with level is given by the first differences of the central Delannoy numbers. Finally, using similar tools, we exhibit a bijection between the set of recurrent configurations of the ASM on fan graphs and the set of subgraphs of the path graph containing the right-most vertex of the path. We show that these sets are also equinumerous with certain lattice paths, which we name Kimberling paths after the author of the corresponding entry in the Online Encyclopedia of Integer Sequences.
arXiv comment25 pages, 12 figures
References in corpus (9)
- Why Delannoy numbers?
- Steady state of Stochastic Sandpile Models
- The Abelian sandpile model on Ferrers graphs -- A classification of recurrent configurations
- The sandpile model on the complete split graph, Motzkin words, and tiered parking functions
- A stochastic variant of the abelian sandpile model
- The sandpile model on K_{m,n} and the rank of its configurations
- On the abelianity of the stochastic sandpile model
- Some bijections for lattice paths
- The sandpile group of polygon rings and twisted polygon rings