EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model
From MaRDI portal
Publication:1658751
Abstract: A EW-tableau is a certain 0/1-filling of a Ferrers diagram, corresponding uniquely to an acyclic orientation, with a unique sink, of a certain bipartite graph called a Ferrers graph. We give a bijective proof of a result of Ehrenborg and van Willigenburg showing that EW-tableaux of a given shape are equinumerous with permutations with a given set of excedances. This leads to an explicit bijection between EW-tableaux and the much studied Le-tableaux, as well as the tree-like tableaux introduced by Aval, Boussicault and Nadeau. We show that the set of EW-tableaux on a given Ferrers diagram are in 1-1 correspondence with the minimal recurrent configurations of the Abelian sandpile model on the corresponding Ferrers graph. Another bijection between EW-tableaux and tree-like tableaux, via spanning trees on the corresponding Ferrers graphs, connects the tree-like tableaux to the minimal recurrent configurations of the Abelian sandpile model on these graphs. We introduce a variation on the EW-tableaux, which we call NEW-tableaux, and present bijections from these to Le-tableaux and tree-like tableaux. We also present results on various properties of and statistics on EW-tableaux and NEW-tableaux, as well as some open problems on these.
Recommendations
Cites work
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- A Markov Chain on Permutations which Projects to the PASEP
- Bijections for permutation tableaux
- Combinatorics of the two-species ASEP and Koornwinder moments
- Enumerative properties of Ferrers graphs
- Generalized pattern avoidance
- Minimal recurrent configurations of chip firing games and directed acyclic graphs
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a \(q,t\)-Narayana polynomial
- Permutation statistics of indexed permutations
- Permutation tableaux and permutation patterns
- Self-organized critical state of sandpile automaton models
- Tableaux combinatorics for the asymmetric exclusion process
- The excedance set of a permutation
- The sand-pile model and Tutte polynomials
- Théorie géométrique des polynômes eulériens
- Tree-like tableaux
- Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a cyclic lemma
Cited in
(13)- A bijection for the Boolean numbers of Ferrers graphs
- The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations
- The structure of alternative tableaux
- Lonesum and \(\Gamma\)-free \(0-1\) fillings of Ferrers shapes
- An Ising model having permutation spin motivated by a permutation complexity measure
- Ferrers graphs, D-permutations, and surjective staircases
- The sandpile model on the complete split graph, Motzkin words, and tiered parking functions
- On the homogenized linial arrangement: intersection lattice and Genocchi numbers
- The homogenized linial arrangement and Genocchi numbers
- Combinatorial aspects of sandpile models on wheel and Fan graphs
- Parallelogram polyominoes and rectangular EW-tableaux: correspondences through the sandpile model
- Interview with Einar Steingrímsson
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
This page was built for publication: EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1658751)