Computational proof of the Mackey formula for q>2

By C'edric Bonnaf'e, Jean Michel. 2010

77 citations recorded by the source corpus.

Let G be a connected reductive group defined over a finite field with q elements. We prove that the Mackey formula for the Lusztig induction and restriction holds in G whenever q>2 or G does not have a component of type E.

Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/172567d889e1b15b64fd62a5036e66d0038aa366

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

1. Gunter Malle
2. Radha Kessar
3. Britta Spath
4. Pham Huu Tiep
5. Gabriel Navarro
6. M. Cabanes
7. Britta Spaeth
8. Raphaël Rouquier

In Geometry and Topology

1. Gunter Malle
2. Radha Kessar
3. Pham Huu Tiep
4. Gabriel Navarro
5. Britta Spath
6. M. Cabanes
7. Britta Spaeth

In Mathematical Physics

1. Gunter Malle
2. Radha Kessar
3. Pham Huu Tiep
4. Gabriel Navarro
5. Britta Spath

Citations in the corpus

• Quasi-isolated blocks and Brauer’s height zero conjecture (2011, background): “For (c), see [21, §11], and see the recent paper of Bonnafé–Michel [7] for (d).”
• The development version of the CHEVIE package of GAP3 (2013, unknown): “ts using CHEVIE We present briefly some of the CHEVIEfacilities for computing with semisimple elements of finite order in reductive groups, with the programs for checking some lemmas which were used in [Bonnafe-Michel2011]. Let Sbe a torus defined over F. The map F×⊗ZY(S) → Sgiven by x⊗λ→ λ(x) is an is”