A recursive method for the oddness of the number of set-valued tableaux
Combinatorics
2026-02-26 v4
Abstract
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.
Keywords
Cite
@article{arxiv.2305.06740,
title = {A recursive method for the oddness of the number of set-valued tableaux},
author = {Taikei Fujii and Takahiko Nobukawa and Tatsushi Shimazaki},
journal= {arXiv preprint arXiv:2305.06740},
year = {2026}
}
Comments
21 pages