Abstract
Dynkin has shown how subsystems of real root systems may be constructed. As the concept of subsystems of complex root systems is not as well developed as in the real case, in this paper we give an algorithm to classify the proper subsystems of complex proper root systems. Furthermore, as an application of this algorithm, we determine the proper subsystems of imprimitive complex proper root systems. These proper subsystems are useful in giving combinatorial constructions of irreducible representations of properly generated finite complex reflection groups.
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.