Table of Contents
Fetching ...

Familles de caracteres de groupes de reflexions complexes

Gunter Malle, Raphael Rouquier

TL;DR

This work extends Lusztig's partition of irreducible characters from Weyl groups to complex reflection groups by identifying Lusztig families with blocks of the Iwahori–Hecke algebra over a suitable ring ${\mathcal{O}}$, and proves a compatibility between these families and Harish-Chandra $d$-series for unipotent characters. It provides a case-by-case determination of ${\mathcal{O}}$-blocks for spetsial exceptional groups (e.g., $G_4$–$G_{37}$), including partial decomposition matrices for bad primes, using algorithmic induction over parabolic subgroups and Chevie-based computations. A central result shows that inside a $d$-series, the Hecke-family blocks are the intersections of Lusztig families with the $d$-series, generalizing Ro’s $d=1$ principal-series compatibility to broader settings. The paper also furnishes explicit data and classifications of decomposition types (e.g., ${\alpha}_{1^2}(3)$, ${\mathcal{M}}(Z_3)$) and demonstrates the practical feasibility of these computations in the spetsial regime, linking Hecke-theoretic block structure to unipotent representations of finite reductive groups.

Abstract

Nous etudions certains types de blocs d'algebres de Hecke associees aux groupes de reflexions complexes qui generalisent les familles de caracteres definies par Lusztig pour les groupes de Weyl. Nous determinons ces blocs pour les groupes de reflexions spetsiaux et nous etablissons un theoreme de compatibilite entre familles et d-series de Harish-Chandra. ----- We study certain types of blocks of Hecke Algebras associated to complex reflection groups which generalize the families of characters defined by Lusztig for Weyl groups. We determine these blocks for the special reflection groups and we establish a compatibility theorem between families and d-series of Harish-Chandra.

Familles de caracteres de groupes de reflexions complexes

TL;DR

This work extends Lusztig's partition of irreducible characters from Weyl groups to complex reflection groups by identifying Lusztig families with blocks of the Iwahori–Hecke algebra over a suitable ring , and proves a compatibility between these families and Harish-Chandra -series for unipotent characters. It provides a case-by-case determination of -blocks for spetsial exceptional groups (e.g., ), including partial decomposition matrices for bad primes, using algorithmic induction over parabolic subgroups and Chevie-based computations. A central result shows that inside a -series, the Hecke-family blocks are the intersections of Lusztig families with the -series, generalizing Ro’s principal-series compatibility to broader settings. The paper also furnishes explicit data and classifications of decomposition types (e.g., , ) and demonstrates the practical feasibility of these computations in the spetsial regime, linking Hecke-theoretic block structure to unipotent representations of finite reductive groups.

Abstract

Nous etudions certains types de blocs d'algebres de Hecke associees aux groupes de reflexions complexes qui generalisent les familles de caracteres definies par Lusztig pour les groupes de Weyl. Nous determinons ces blocs pour les groupes de reflexions spetsiaux et nous etablissons un theoreme de compatibilite entre familles et d-series de Harish-Chandra. ----- We study certain types of blocks of Hecke Algebras associated to complex reflection groups which generalize the families of characters defined by Lusztig for Weyl groups. We determine these blocks for the special reflection groups and we establish a compatibility theorem between families and d-series of Harish-Chandra.

Paper Structure

This paper contains 8 sections, 1 theorem, 37 equations, 1 table.

Key Result

Proposition 2.5

Lorsque $W$ est un groupe de Coxeter fini, un caractère est constructible (au sens défini ci-dessus) si et seulement si il est constructible au sens de Lusztig.

Theorems & Definitions (8)

  • Conjecture 2.1
  • Conjecture 2.2
  • Conjecture 2.3
  • Proposition 2.5
  • proof : Preuve
  • proof : Preuve
  • proof : Preuve
  • proof : Preuve