MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The Murnaghan-Nakayama rule for S_n is a combinatorial rule to compute the irreducible characters of the symmetric group. Is there a q-analogue of this rule for GL(n,q) to compute the irreducible characters? For example, exhibiting that the value of the unipotent characters of GL(n,q) on a unipotent class is given by the cocharge Kostka-Foulkes polynomials, and showing other special cases.

share|cite|improve this question

I presume you're talking about characters over C. In which case Green's classic paper "The characters of the finite general linear groups" is the only thing I know on this subject. He defines a whole load of polynomials (that have since come to be known as Green polynomials), out of which he's able to extract a list of the irreducible characters.

Green's paper is the mathematical ancestor of the Deligne-Lusztig theory of irreducible characters.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.