A combinatorial proof of the skew K-saturation theorem

DOI10.1016/J.DISC.2014.08.025zbMATH Open1301.05359OpenAlexW2100830048MaRDI QIDQ468441FDOQ468441

Authors 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

stretchingYoung tableauxGelfand-Tsetlin patternsK-saturation conjectureskew Kostka coefficients

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

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 klambda/kmu{} and type k

u{} to the set of skew semistandard Young tableaux of shape lambda/mu{} and type

u. Based on this method, we pose some natural conjectural refinements on related problems.

Recommendations

• A combinatorical proof of Kneser's conjecture
• A combinatorial proof of a theorem of Katsuura
• Proof of the Combinatorial Kirillov-Reshetikhin Conjecture
• A combinatorial approach for Keller's conjecture
• A skew version of the Loebl-Komlós-Sós conjecture
• A combinatorial proof of Louck's conjecture
• A combinatorial proof of the Burdzy-Pitman conjecture
• A combinatorial proof of a theorem of Freund
• A version of the Loebl-Komlós-Sós conjecture for skew trees
• scientific article; zbMATH DE number 3995753

Cites work

• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• scientific article; zbMATH DE number 2124855 (Why is no real title available?)
• scientific article; zbMATH DE number 3056353 (Why is no real title available?)
• A polynomiality property for Littlewood-Richardson coefficients
• Deciding positivity of Littlewood-Richardson coefficients
• Degrees of stretched Kostka coefficients
• Enumerative combinatorics. Volume 2.
• Geometric proofs of Horn and saturation conjectures
• On the Littlewood-Richardson polynomials
• The Bethe Ansatz and the combinatorics of Young tableaux
• 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
• The minimum period of the Ehrhart quasi-polynomial of a rational polytope
• The saturation conjecture (after A. Knutson and T. Tao). With an appendix by William Fulton
• Vertices of Gelfand-Tsetlin polytopes

Cited in

(2)

• A combinatorial proof of a theorem of Katsuura
• A skew version of the Loebl-Komlós-Sós conjecture

This page was built for publication: A combinatorial proof of the skew K-saturation theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468441)