Abstract

We study a shift action defined on multipartitions and on residue multisets of their Young diagrams. We prove that the minimal orbit cardinality among all multipartitions associated to a given multiset depends only on the orbit cardinality of the multiset. Using abaci, this problem reduces to a convex optimisation problem over the integers with linear constraints. We solve it by proving an existence theorem for binary matrices with prescribed row, column and block sums. Finally, we give some applications to the representation theory of the Hecke algebra of the complex reflection group $G(r,p,n)$.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.