A combinatorial proof of the skew K-saturation theorem

From MaRDI portal
Publication:468441

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


Authors: Per Alexandersson Edit this on Wikidata


Publication date: 7 November 2014

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

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.


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




Recommendations




Cites Work


Cited In (2)





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)