Abstract
The notion of the connectivity class of minimal words in the algebra Hn(q) is introduced and a method of explicitly constructing irreducible representation matrices is described and implemented. Guided by these results, the connection between the Ocneanu trace on Hn(q) and Schur functions is exploited to derive a very simple prescription for calculating the irreducible characters of Hn(q). They appear as the elements of the transition matrix relating certain generalized power sum symmetric functions to Schur functions. Their evaluation involves the use of the Littlewood–Richardson rule, which is proved to apply to Hn(q) just as it does to Sn. Both representation matrices and characters are tabulated.
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 callDisclaimer: 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.
