Kronecker products and the RSK correspondence.

From MaRDI portal
Revision as of 03:36, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:408189

DOI10.1016/J.DISC.2012.01.006zbMATH Open1257.20008arXiv1003.4482OpenAlexW2048226952MaRDI QIDQ408189

Author name not available (Why is that?)

Publication date: 29 March 2012

Published in: (Search for Journal in Brave)

Abstract: The starting point for this work is an identity that relates the number of minimal matrices with prescribed 1-marginals and coefficient sequence to a linear combination of Kronecker coefficients. In this paper we provide a bijection that realizes combinatorially this identity. As a consequence we obtain an algorithm that to each minimal matrix associates a minimal component, with respect to the dominance order, in a Kronecker product, and a combinatorial description of the corresponding Kronecker coefficient in terms of minimal matrices and tableau insertion. Our bijection follows from a generalization of the dual RSK correspondence to 3-dimensional binary matrices, which we state and prove. With the same tools we also obtain a generalization of the RSK correspondence to 3-dimensional integer matrices.


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



No records found.


No records found.








This page was built for publication: Kronecker products and the RSK correspondence.

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