Combinatorial methods of character enumeration for the unitriangular group
arXiv:1012.2341 · doi:10.1016/j.jalgebra.2011.07.035
Abstract
Let $\UT_n(q)$ denote the group of unipotent upper triangular matrices over a field with elements. The degrees of the complex irreducible characters of $\UT_n(q)$ are precisely the integers with , and it has been conjectured that the number of irreducible characters of $\UT_n(q)$ with degree is a polynomial in with nonnegative integer coefficients (depending on and ). We confirm this conjecture when and is arbitrary by a computer calculation. In particular, we describe an algorithm which allows us to derive explicit bivariate polynomials in and giving the number of irreducible characters of $\UT_n(q)$ with degree when and . When divided by and written in terms of the variables and , these functions are actually bivariate polynomials with nonnegative integer coefficients, suggesting an even stronger conjecture concerning such character counts. As an application of these calculations, we are able to show that all irreducible characters of $\UT_n(q)$ with degree are Kirillov functions. We also discuss some related results concerning the problem of counting the irreducible constituents of individual supercharacters of $\UT_n(q)$.
34 pages, 5 tables
References in corpus (4)
Cited by in corpus (7)
- Supercharacters, symmetric functions in noncommuting variables, and related Hopf algebras
- On Higman's conjecture
- Exotic characters of unitriangular matrix groups
- Heisenberg characters, unitriangular groups, and Fibonacci numbers
- Iterative character constructions for algebra groups
- Asymptotic results for Representation Theory
- Supercharacters of unipotent and solvable groups