Hook-valued tableau uncrowding and tableau switching
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918274393964544 |
|---|---|
| author | Jang, Jihyeug Kim, Jang Soo Pan, Jianping Pappe, Joseph Schilling, Anne |
| author_facet | Jang, Jihyeug Kim, Jang Soo Pan, Jianping Pappe, Joseph Schilling, Anne |
| contents | 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 the image of the uncrowding map. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_18343 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Hook-valued tableau uncrowding and tableau switching Jang, Jihyeug Kim, Jang Soo Pan, Jianping Pappe, Joseph Schilling, Anne Combinatorics Primary 05E05, 05A19, Secondary 05E10, 14N10, 14N15 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 the image of the uncrowding map. |
| title | Hook-valued tableau uncrowding and tableau switching |
| topic | Combinatorics Primary 05E05, 05A19, Secondary 05E10, 14N10, 14N15 |
| url | https://arxiv.org/abs/2410.18343 |