A recursive method for the oddness of the number of set-valued tableaux
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910031991013376 |
|---|---|
| author | Fujii, Taikei Nobukawa, Takahiko Shimazaki, Tatsushi |
| author_facet | Fujii, Taikei Nobukawa, Takahiko Shimazaki, Tatsushi |
| contents | Set-valued tableaux, introduced by Buch to express the tableaux-sum formula for stable Grothendieck polynomials, generalize semistandard tableaux. We provide a new recursive proof that the number of set-valued tableaux of a given shape is odd. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_06740 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A recursive method for the oddness of the number of set-valued tableaux Fujii, Taikei Nobukawa, Takahiko Shimazaki, Tatsushi Combinatorics 05A17, 05E05 Set-valued tableaux, introduced by Buch to express the tableaux-sum formula for stable Grothendieck polynomials, generalize semistandard tableaux. We provide a new recursive proof that the number of set-valued tableaux of a given shape is odd. |
| title | A recursive method for the oddness of the number of set-valued tableaux |
| topic | Combinatorics 05A17, 05E05 |
| url | https://arxiv.org/abs/2305.06740 |