An insertion algorithm on multiset partitions with applications to diagram algebras

DOI10.1016/J.JALGEBRA.2020.04.010zbMATH Open1460.05195arXiv1905.02071OpenAlexW3017883232MaRDI QIDQ2178556FDOQ2178556

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

Publication date: 11 May 2020

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: 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.

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

Recommendations

• An insertion algorithm for diagram algebras
• RSK insertion for set partitions and diagram algebras
• Set-partition tableaux and representations of diagram algebras
• The multiset partition algebra
• scientific article; zbMATH DE number 2242531
• Embedding dualities for set partitions and for relational structures
• Publication:4886037
• Set-partition tableaux, symmetric group multiplicities, and partition algebra modules
• Algorithms for Graphic Polymatroids and Parametrics-Sets
• Algorithms for constructing the shortest allowable partitions of finite sets

zbMATH Keywords

representation theoryRSK algorithmpartition algebrasmultiset tableaux

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Partitions of sets (05A18) Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30)

Cites Work

• Title not available (Why is that?)
• Ideals, Varieties, and Algorithms
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Index for subfactors
• Title not available (Why is that?)
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
• Representations of the rook monoid.
• On the representation theory of partial Brauer algebras
• Representations of the rook-Brauer algebra
• Partition algebras.
• On the structure of Brauer's centralizer algebras
• On algebras which are connected with the semisimple continuous groups
• Representation theory of the symmetric groups. The Okounkov-Vershik approach, character formulas, and partition algebras.
• Enumerative applications of a decomposition for graphs and digraphs
• On an algebraic approach to higher dimensional statistical mechanics
• Motzkin algebras
• Title not available (Why is that?)
• The representation theory of the Temperley-Lieb algebras
• RSK insertion for set partitions and diagram algebras
• Representations of graph Temperley-Lieb algebras
• Characters of the partition algebras.
• Representations of the \(q\)-rook monoid.
• Title not available (Why is that?)
• Combinatory analysis. Vols. I, II (bound in one volume)
• The planar rook algebra and Pascal's triangle.
• Products of symmetric group characters
• Dimensions of irreducible modules for partition algebras and tensor power multiplicities for symmetric and alternating groups
• Set-partition tableaux, symmetric group multiplicities, and partition algebra modules
• Partition algebras and the invariant theory of the symmetric group
• Set-partition tableaux and representations of diagram algebras
• The multiset partition algebra

Cited In (16)

• Representations of the quasi-partition algebras
• Robinson-Schensted correspondence for party algebras
• RSK insertion for set partitions and diagram algebras
• Set-partition tableaux, symmetric group multiplicities, and partition algebra modules
• Howe duality of the symmetric group and a multiset partition algebra
• Plethysm and the algebra of uniform block permutations
• Multiparameter colored partition category and the product of the reduced Kronecker coefficients
• A diagram-like basis for the multiset partition algebra
• Robinson-Schensted correspondence for the signed Brauer algebras
• The multiset partition algebra
• Traces on diagram algebras. II: Centralizer algebras of easy groups and new variations of the Young graph
• An insertion algorithm for diagram algebras
• Young-type matrix units for non-propagating partition algebra submodules
• Super multiset RSK and a mixed multiset partition algebra
• Cellular subalgebras of the partition algebra
• Alternating submodules for partition algebras, rook algebras, and rook-Brauer algebras

Uses Software

• OEIS

This page was built for publication: An insertion algorithm on multiset partitions with applications to diagram algebras

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