A combinatorial proof of the skew K-saturation theorem

DOI10.1016/j.disc.2014.08.025zbMath1301.05359arXiv1307.3999OpenAlexW2100830048MaRDI QIDQ468441

Per Alexandersson

Publication date: 7 November 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.3999

zbMATH Keywords

Young tableauxstretchingGelfand-Tsetlin patternsK-saturation conjectureskew Kostka coefficients

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees of stretched Kostka coefficients
• The Bethe Ansatz and the combinatorics of Young tableaux
• The saturation conjecture (after A. Knutson and T. Tao). With an appendix by William Fulton
• Vertices of Gelfand-Tsetlin polytopes
• The minimum period of the Ehrhart quasi-polynomial of a rational polytope
• On the Littlewood-Richardson polynomials
• A polynomiality property for Littlewood-Richardson coefficients
• Geometric proofs of Horn and saturation conjectures
• The honeycomb model of $GL_n(\mathbb C)$ tensor products I: Proof of the saturation conjecture
• The honeycomb model of 𝐺𝐿_{𝑛}(ℂ) tensor products II: Puzzles determine facets of the Littlewood-Richardson cone
• Deciding Positivity of Littlewood--Richardson Coefficients