Semisimple algebras related to immaculate tableaux
Abstract
Given a direct sum A of full matrix algebras, if there is a combinatorial interpretation associated with both the dimension of A and the dimensions of the irreducible A-modules, then this can be thought of as providing an analogue of the famous Frobenius-Young identity n! = Σλ n ( fλ )2 derived from the semisimple structure of the symmetric group algebra CSn, letting fλ denote the number of Young tableaux of partition shape λ n. By letting gα denote the number of standard immaculate tableaux of composition shape α n, we construct an algebra CIn with a semisimple structure such that CIn = Σα n (gα)2 and such that CIn contains an isomorphic copy of CSn. We bijectively prove a recurrence for CIn so as to construct a basis of CIn indexed by permutation-like objects that we refer to as immacutations. We form a basis Bn of CIn such that C Bn has the structure of a monoid algebra in such a way so that Bn is closed under the multiplicative operation of C In, yielding a monoid structure on the set of order-n immacutations.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.