Combinatorial proof of the skew K-saturation theorem
arXiv:1307.3999 · doi:10.1016/j.disc.2014.08.025
Abstract
We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape kλ/kμ and type kν to the set of skew semistandard Young tableaux of shape λ/μ and type ν. Based on this method, we pose some natural conjectural refinements on related problems.
arXiv commentSignificantly updated version