arXiv Analytics

Sign in

arXiv:1905.02071 [math.CO]AbstractReferencesReviewsResources

An insertion algorithm on multiset partitions with applications to diagram algebras

Laura Colmenarejo, Rosa Orellana, Franco Saliola, Anne Schilling, Mike Zabrocki

Published 2019-05-06Version 1

We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer algebras and the spaces they act on. In addition, restrictions on the multisets lead to further identities and representation theory analogues. For instance, we obtain a bijection between words of length $k$ with entries in $[n]$ and pairs of tableaux of the same shape with one being a standard Young tableau of size $n$ and the other being a standard multiset tableau of content $[k]$. We also obtain an algorithm from partition diagrams to pairs of a standard tableau and a standard multiset tableau of the same shape, which has the remarkable property that it is well-behaved with respect to restricting a representation to a subalgebra. This insertion algorithm matches recent representation-theoretic results of Halverson and Jacobson.

Related articles: Most relevant | Search more
arXiv:0906.1389 [math.CO] (Published 2009-06-07, updated 2009-08-21)
A $q$-analogue of the FKG inequality and some applications
arXiv:math/0102176 [math.CO] (Published 2001-02-22, updated 2002-01-29)
Applications of Symmetric Functions to Cycle and Subsequence Structure after Shuffles
arXiv:math/0501186 [math.CO] (Published 2005-01-12, updated 2006-03-07)
A q-Analog of Dual Sequences with Applications