Papers › Super Multiset RSK and a Mixed Multiset Partition Algebra
Super Multiset RSK and a Mixed Multiset Partition Algebra
Alexander Wilson
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Through dualities on representations on tensor powers and symmetric powers respectively, the partition algebra and multiset partition algebra have been used to study long-standing questions in the representation theory of the symmetric group. In this paper we extend this story to exterior powers, introducing the mixed multiset partition algebra as well as a generalization of the Robinson-Schensted-Knuth algorithm to two-row arrays of multisets with elements from two alphabets. From this algorithm, we obtain enumerative results which reflect representation-theoretic decompositions of this algebra. Furthermore, we use the generalized RSK algorithm to describe the decomposition of a polynomial ring in sets of commuting and anti-commuting variables as a module over both the general linear group and the symmetric group.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections