Combinatorial methods of character enumeration for the unitriangular group.

From MaRDI portal




Abstract: Let UTn(q) denote the group of unipotent nimesn upper triangular matrices over a field with q elements. The degrees of the complex irreducible characters of UTn(q) are precisely the integers qe with 0leqeleqlfloorfracn2floorlfloorfracn12floor, and it has been conjectured that the number of irreducible characters of UTn(q) with degree qe is a polynomial in q1 with nonnegative integer coefficients (depending on n and e). We confirm this conjecture when eleq8 and n is arbitrary by a computer calculation. In particular, we describe an algorithm which allows us to derive explicit bivariate polynomials in n and q giving the number of irreducible characters of UTn(q) with degree qe when n>2e and eleq8. When divided by qne2 and written in terms of the variables n2e1 and q1, 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 UTn(q) with degree leqq8 are Kirillov functions. We also discuss some related results concerning the problem of counting the irreducible constituents of individual supercharacters of UTn(q).



Cites work



Describes a project that uses

Uses Software





This page was built for publication: Combinatorial methods of character enumeration for the unitriangular group.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408525)