Laura Colmenarejo, University of Massachusetts- Amherst, An insertion algorithm on multiset partitions with applications to diagram algebras
ZoomIn algebraic combinatorics, the Robinson-Schensted-Knuth algorithm is a fundamental correspondence between words and pairs of semistandard tableaux illustrating identities of dimensions of irreducible representations of several groups. In this talk, I will present a generalization of the Robinson-Schensted-Knuth algorithm to the insertion of two-row arrays of multisets. This generalization leads to new enumerative results that have…