Counting p'-characters in finite reductive groups

Details Counting p'-characters in finite reductive groups Counting p'-characters in finite reductive groups

2009-06-09

arxiv.org/abs/0906.1790v2

Mathematics

Representation Theory

Scientific paper

This article is concerned with the relative McKay conjecture for finite reductive groups. Let G be a connected reductive group defined over the finite field F_q of characteristic p>0 with corresponding Frobenius map F. We prove that if the F-coinvariants of the component group of the center of G has prime order and if p is a good prime for G, then the relative McKay conjecture holds for G at the prime p. In particular, this conjecture is true for G^F in defining characteristic for G a simple and simply-connected group of type B_n, C_n, E_6 and E_7. Our main tools are the theory of Gelfand-Graev characters for connected reductive groups with disconnected center developed by Digne-Lehrer-Michel and the theory of cuspidal Levi subgroups. We also explicitly compute the number of semisimple classes of G^F for any simple algebraic group G.

Affiliated with

Also associated with

No associations

Rating

Counting p'-characters in finite reductive groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting p'-characters in finite reductive groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting p'-characters in finite reductive groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-65497