Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a cyclic lemma
From MaRDI portal
(Redirected from Publication:900982)
Abstract: We introduce two operators on stable configurations of the sandpile model that provide an algorithmic bijection between recurrent and parking configurations. This bijection preserves their equivalence classes with respect to the sandpile group. The study of these operators in the special case of the complete bipartite graph naturally leads to a generalization of the well known Cyclic Lemma of Dvoretsky and Motzkin, via pairs of periodic bi-infinite paths in the plane having slightly different slopes. We achieve our results by interpreting the action of these operators as an action on a point in the grid which is pointed to by one of these pairs of paths. Our Cyclic lemma allows us to enumerate several classes of polyominoes, and therefore builds on the work of Irving and Rattan (2009), Chapman et al. (2009), and Bonin et al. (2003).
Recommendations
- The sand-pile model and Tutte polynomials
- The sandpile model on \(K_{m,n}\) and the rank of its configurations
- Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a \(q,t\)-Narayana polynomial
- Combinatorial aspects of sandpile models on wheel and Fan graphs
- The sandpile model on a bipartite graph, parallelogram polyominoes, and a q,t-Narayana polynomial
Cites work
- A problem of arrangements
- Combinatorics of labelled parallelogram polyominoes
- Lattice path matroids: Enumerative aspects and Tutte polynomials
- On the sandpile group of dual graphs
- Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a \(q,t\)-Narayana polynomial
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Simple formulas for lattice paths avoiding certain periodic staircase boundaries
- Statistics on parallelogram polyominoes and a \(q,t\)-analogue of the Narayana numbers
- The number of lattice paths below a cyclically shifting boundary
- Trees, parking functions, syzygies, and deformations of monomial ideals
- Une demonstration combinatoire de la formule de Lagrange à deux variables
Cited in
(16)- The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations
- Abelian and stochastic sandpile models on complete bipartite graphs
- Shuffle theorems and sandpiles
- The sandpile model on the complete split graph, Motzkin words, and tiered parking functions
- scientific article; zbMATH DE number 7556143 (Why is no real title available?)
- EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model
- The sandpile model on a bipartite graph, parallelogram polyominoes, and a q,t-Narayana polynomial
- Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a \(q,t\)-Narayana polynomial
- Skeletal generalizations of chip-firing games, parking functions, and Dyck paths
- The sandpile model on \(K_{m,n}\) and the rank of its configurations
- A maximizing characteristic for critical configurations of chip-firing games on digraphs
- A note on the lacking polynomial of the complete bipartite graph
- Parallelogram polyominoes and rectangular EW-tableaux: correspondences through the sandpile model
- Decomposing recurrent states of the abelian sandpile model
- Combinatorial aspects of sandpile models on wheel and Fan graphs
- Decomposing recurrent states of the abelian sandpile model
This page was built for publication: Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a cyclic lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q900982)
