Hook-valued tableau uncrowding and tableau switching
Jihyeug Jang, Jang Soo Kim, Jianping Pan, Joseph Pappe, Anne Schilling

TL;DR
This paper uncovers a new connection between two combinatorial models for refined canonical stable Grothendieck polynomials, revealing symmetries and leading to a novel tableau model involving biflagged tableaux.
Contribution
It establishes a link between hook-valued tableaux and pairs of tableaux via uncrowding and jeu de taquin algorithms, introducing a new model with biflagged tableaux.
Findings
Discovered a symmetry in the uncrowding algorithm on hook-valued tableaux.
Connected two combinatorial models for Grothendieck polynomials.
Introduced a new model using biflagged tableaux.
Abstract
Refined canonical stable Grothendieck polynomials were introduced by Hwang, Jang, Kim, Song, and Song. There exist two combinatorial models for these polynomials: one using hook-valued tableaux and the other using pairs of a semistandard Young tableau and (what we call) an exquisite tableau. An uncrowding algorithm on hook-valued tableaux was introduced by Pan, Pappe, Poh, and Schilling. In this paper, we discover a novel connection between the two models via the uncrowding and Goulden--Greene's jeu de taquin algorithms, using a classical result of Benkart, Sottile, and Stroomer on tableau switching. This connection reveals a symmetry of the uncrowding algorithm defined on hook-valued tableaux. As a corollary, we obtain another combinatorial model for the refined canonical stable Grothendieck polynomials in terms of biflagged tableaux, which naturally appear in the characterization of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Advanced Algebra and Logic
