Dyck tilings, increasing trees, descents, and inversions
From MaRDI portal
Publication:2341249
DOI10.1016/j.jcta.2013.09.008zbMath1311.05207arXiv1205.6578OpenAlexW2057220168MaRDI QIDQ2341249
Karola Mészáros, Greta Panova, Jang Soo Kim, David Bruce Wilson
Publication date: 23 April 2015
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.6578
Trees (05C05) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of representation theory (05E10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items
Dyck tilings and the homogeneous Garnir relations for graded Specht modules ⋮ Boundary correlations in planar LERW and UST ⋮ The Space of Circular Planar Electrical Networks ⋮ A quantitative study of pure parallel processes ⋮ Pfaffian Formulas for Spanning Tree Probabilities ⋮ Proofs of two conjectures of Kenyon and Wilson on Dyck tilings ⋮ Rooted forests that avoid sets of permutations ⋮ The \(m\)-cover posets and their applications ⋮ Generalized Dyck tilings ⋮ Classical and consecutive pattern avoidance in rooted forests ⋮ Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
Cites Work
- Dyck tableaux
- Tree-like tableaux
- Proofs of two conjectures of Kenyon and Wilson on Dyck tilings
- Fully packed loops in a triangle: matchings, paths and puzzles
- Double-dimer pairings and skew Young diagrams
- New Euler-Mahonian statistics on permutations and words
- q-hook length formulas for forests
- Path representation of maximal parabolic Kazhdan-Lusztig polynomials.
- Dyck tilings and the homogeneous Garnir relations for graded Specht modules
- Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
- Ordered structures and partitions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
