Uncrowding algorithm for hook-valued tableaux

DOI10.1007/s00026-022-00567-6zbMath1491.05195arXiv2012.14975OpenAlexW4210653931MaRDI QIDQ2128846

Anne Schilling, Wencin Poh, Joseph Pappe, Jian-Ping Pan

Publication date: 22 April 2022

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.14975

zbMATH Keywords

crystal baseshook-valued tableauxstable (canonical) Grothendieck polynomialsuncrowding algorithm

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Enumerative problems (combinatorial problems) in algebraic geometry (14N10) Quantum groups (quantized function algebras) and their representations (20G42) Classical problems, Schubert calculus (14N15)

Related Items (3)

Crystals and integrable systems for edge labeled tableaux ⋮ Free fermions and canonical Grothendieck polynomials ⋮ Integrable systems and crystals for edge labeled tableaux

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality and deformations of stable Grothendieck polynomials
• Poset edge densities, nearly reduced words, and barely set-valued tableaux
• Antipode formulas for some combinatorial Hopf algebras
• A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
• Combinatorial expansions in \(K\)-theoretic bases
• Combinatorial aspects of the \(K\)-theory of Grassmannians
• A crystal on decreasing factorizations in the 0-Hecke monoid
• Crystal structures for canonical Grothendieck functions
• Combinatorial relations on skew Schur and skew stable Grothendieck polynomials
• Crystal Bases
• Combinatorial Hopf Algebras and K-Homology of Grassmanians
• Crystal structures for symmetric Grothendieck polynomials

This page was built for publication: Uncrowding algorithm for hook-valued tableaux