2010
DOI: 10.1112/jlms/jdq001
|View full text |Cite
|
Sign up to set email alerts
|

Counting p ′-characters in finite reductive groups

Abstract: 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 𝔽q of characteristic p > 0 with corresponding Frobenius map F. We prove that, if p is a good prime for G and if the group of F‐coinvariants of the component group of the centre of G has prime order, then the relative McKay conjecture holds for GF at the prime p. In particular, this conjecture is true for GF in the defining characteristic for a simple simp… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
14
0

Year Published

2011
2011
2015
2015

Publication Types

Select...
5

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(14 citation statements)
references
References 4 publications
0
14
0
Order By: Relevance
“…2 Remark 5.12. In the proof of Theorem 5.11, we need the assumption that p is a good prime for G only in order to apply the results of [3]. Proof.…”
Section: Then There Is An a ν -Equivariant Bijection Between Irr P (Gmentioning
confidence: 99%
“…2 Remark 5.12. In the proof of Theorem 5.11, we need the assumption that p is a good prime for G only in order to apply the results of [3]. Proof.…”
Section: Then There Is An a ν -Equivariant Bijection Between Irr P (Gmentioning
confidence: 99%
“…1Z ,3 is in bijection with the D-orbits of size 3 of Irr s (B σ i F j , 1 Z ). As above,[1, 2.17] and[5, Lemma 5.4] implies that |O′ σ i F j D,1Z ,3 | = p 2n/d . This discussion proves that, if ν = 1 Z , then for every H ≤ A Now, if ν = ε m with m = ±1, then A ν = σF and for every H = σ i F n/d ≤ A ν , the same argument shows that | = p 2n/d = |O ′H D,ε m ,3 |.…”
mentioning
confidence: 91%
“…In [5], we explicitly computed the number of semisimple classes of G * F * when G * is simple and p is a good prime for G * . For that, we used the theory of Gelfand-Graev characters for connected reductive groups with disconnected center, developed by Digne-Lehrer-Michel in [12] and [13].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Theorem 5.2 is a generalisation of a result due to Brunat ([5], Theorem 1.1). We use many of the same ingredients as the proof in [5], but avoid explicit computations.…”
Section: Groups Of Lie Type In the Defining Characteristicmentioning
confidence: 99%