Abstract
AbstractWhereas set-valued tableaux are the combinatorial objects associated to stable Grothendieck polynomials, hook-valued tableaux are associated with stable canonical Grothendieck polynomials. In this paper, we define a novel uncrowding algorithm for hook-valued tableaux. The algorithm “uncrowds” the entries in the arm of the hooks, and yields a set-valued tableau and a column-flagged increasing tableau. We prove that our uncrowding algorithm intertwines with crystal operators. An alternative uncrowding algorithm that “uncrowds” the entries in the leg instead of the arm of the hooks is also given. As an application of uncrowding, we obtain various expansions of the canonical Grothendieck polynomials.
Funder
Directorate for Mathematical and Physical Sciences
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics
Reference16 articles.
1. Jason Bandlow and Jennifer Morse. Combinatorial expansions in $$K$$-theoretic bases. Electron. J. Combin., 19(4):Paper 39, 27, 2012.
2. Daniel Bump and Anne Schilling. Crystal bases. World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2017. Representations and combinatorics.
3. Anders Skovsted Buch. A Littlewood-Richardson rule for the $$K$$-theory of Grassmannians. Acta Math., 189(1):37–78, 2002.
4. Melody Chan and Nathan Pflueger. Combinatorial relations on skew Schur and skew stable Grothendieck polynomials. Algebr. Comb., 4(1):175–188, 2021.
5. William Fulton. Young tableaux, volume 35 of London Mathematical Society Student Texts. Cambridge University Press, Cambridge, 1997. With applications to representation theory and geometry.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献