Abstract
We introduce and study a multiparameter colored partition category CPar(x) by extending the construction of the partition category, over an algebraically closed field k of characteristic zero and for a multiparameter x∈kr. The morphism spaces in CPar(x) have bases in terms of partition diagrams whose parts are colored by elements of the multiplicative cyclic group Cr. We show that the endomorphism spaces of CPar(x) and additive Karoubi envelope of CPar(x) are generically semisimple. The category CPar(x) is rigid symmetric strict monoidal and we give a presentation of CPar(x) as a monoidal category. The path algebra of CPar(x) admits a triangular decomposition with Cartan subalgebra being equal to the direct sum of the group algebras of complex reflection groups G(r,n). We compute the structure constants for the classes of simple modules in the split Grothendieck ring of the category of modules over the path algebra of the downward partition subcategory of CPar(x) in two ways. Among other things, this gives a formula for the product of the reduced Kronecker coefficients in terms of the Littlewood–Richardson coefficients for G(r,n) and certain Kronecker coefficients for the wreath product (Cr×Cr)≀Sn. For r=1, this formula reduces to a formula for the reduced Kronecker coefficients given by Littlewood. We also give two analogues of the Robinson–Schensted correspondence for colored partition diagrams and, as an application, we classify the equivalence classes of Green's left, right and two-sided relations for the colored partition monoid in terms of these correspondences.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.