Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
From MaRDI portal
Publication:2194766
DOI10.1016/j.jcta.2020.105304zbMath1447.05223arXiv1911.07799OpenAlexW3047957910MaRDI QIDQ2194766
Publication date: 7 September 2020
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.07799
Related Items (1)
Cites Work
- Unnamed Item
- \(K\)-Knuth equivalence for increasing tableaux
- \(K\)-theory of minuscule varieties
- Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm
- Increasing and decreasing sequences in fillings of moon polyominoes
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
- Vacillating Hecke tableaux and linked partitions
- Linked partitions and linked cycles
- A spherical initial ideal for Pfaffians
- \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams
- A jeu de taquin theory for increasing tableaux, with application to \(K\)-theoretic Schubert calculus
- Duality of graded graphs
- Schensted algorithms for dual graded graphs
- Dual filtered graphs
- A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
- Maximal increasing sequences in fillings of almost-moon polyominoes
- Stable Grothendieck polynomials and \(K\)-theoretic factor sequences
- Decreasing subsequences in permutations and Wilf equivalence for involutions
- Generalized triangulations and diagonal-free subsets of stack polyominoes
- Wilf-equivalence for singleton classes
- Crossings and nestings of matchings and partitions
This page was built for publication: Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
