A combinatorial proof of the skew K-saturation theorem

作者：Alexandersson Per^*

来源：Discrete Mathematics, 2015, 338(1): 93-102.

DOI：10.1016/j.disc.2014.08.025

• Young tableaux
• Skew Kostka coefficients
• K-saturation conjecture
• Gelfand-Tsetlin patterns
• Stretching

We give a combinatorial proof of the skew version 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 lambda/k mu, and type k nu, to the set of skew semistandard Young tableaux of shape lambda/mu. and type nu.
Based on this method, we pose some natural conjectural generalizations on related problems.

• 出版日期2015-1-6