Characters of Renner Monoids and Their Hecke Algebras
Representation Theory
2020-07-08 v3
Abstract
This paper gives a general algorithm for computing the character table of any Renner monoid Hecke algebra, by adapting and generalizing techniques of Solomon used to study the rook monoid. The character table of the Hecke algebra of the rook monoid (i.e., the Cartan type Renner monoid) was computed earlier by Dieng, Halverson, and Poladian using different methods. Our approach uses analogues of so-called A- and B-matrices of Solomon. In addition to the algorithm, we give explicit combinatorial formulas for the A- and B-matrices in Cartan type and use them to obtain an explicit description of the character table for the type Renner monoid Hecke algebra.
Cite
@article{arxiv.1811.12343,
title = {Characters of Renner Monoids and Their Hecke Algebras},
author = {Andy Hardt and Jared Marx-Kuo and Vaughan McDonald and John M. O'Brien and Alexander Vetter},
journal= {arXiv preprint arXiv:1811.12343},
year = {2020}
}