Counting characters of small degree in upper unitriangular groups.

Abstract: Let

U_{n}

denote the group of upper

n i m e s n

unitriangular matrices over a fixed finite field

m a t h b b F

of order

q

. That is,

U_{n}

consists of upper triangular

n i m e s n

matrices having every diagonal entry equal to

1

. It is known that the degrees of all irreducible complex characters of

U_{n}

are powers of

q

. It was conjectured by Lehrer that the number of irreducible characters of

U_{n}

of degree

q^{e}

is an integer polynomial in

q

depending only on

e

and

n

. We show that there exist recursive (for

n

) formulas that this number satisfies when

e

is one of

1, 2

and

3

, and thus show that the conjecture is true in those cases.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: Counting characters of small degree in upper unitriangular groups.