Key points are not available for this paper at this time.
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.
King et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: