SearcharxivSearch

arXiv · 1312.0106

Towards a Jordan decomposition of blocks of finite reductive groups

Abstract

\input amssym.def \input amssym.tex Let $G$ be a connected algebraic reductive group over an algebraic closure of a prime field ${\Bbb F}_p$, defined over ${\Bbb F}_q$ thanks to a Frobenius $F$. Let $\ell$ be a prime different from $p$. Let $B$ be an $\ell$-block of the subgroup of rational points $G^F$. Under mild restrictions on $\ell$, we show the existence of an algebraic reductive group $H$ defined over ${\Bbb F}_q$ {\it via} a Frobenius $F$, and of a unipotent $\ell$-block $b$ of $H^F$ such that : the respective defect groups of $b$ and $B$ are isomorphic, the associated Brauer categories are isomorphic and there is a height preserving one-to-one map from the set of irreducible representations of $b$ onto the set of irreducible representations of $B$. \end

Explore related subjects

Keep this discovery

BibTeXRIS

Michel E. Enguehard. 2013-11-30. Towards a Jordan decomposition of blocks of finite reductive groups. https://arxiv.org/abs/1312.0106

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR