Computational proof of the Mackey formula for \(q>2\).

From MaRDI portal
Publication:536033

DOI10.1016/j.jalgebra.2010.10.030zbMath1231.20041arXiv1003.4922OpenAlexW4301641530MaRDI QIDQ536033

Cédric Bonnafé, Jean Michel

Publication date: 16 May 2011

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.4922




Related Items (21)

Bounds on the number of irreducible Brauer characters in blocks of finite groups of exceptional Lie typeInductive blockwise Alperin weight condition for type \(\mathsf{B}\) and odd primesAlperin weight conjecture and related developmentsOn the Morita Frobenius numbers of blocks of finite reductive groupsMorita equivalence classes of tame blocks of finite groupsQuasi-isolated blocks and Brauer's height zero conjecture.Galois group action and Jordan decomposition of characters of finite reductive groups with connected centerFinding characters satisfying a maximal condition for their unipotent support.Formulae for two-variable Green functionsCategorical actions on unipotent representations of finite unitary groupsCounting conjectures and \(e\)-local structures in finite reductive groupsCategorical actions on unipotent representations of finite classical groupsBrauer trees of unipotent blocksLusztig induction, unipotent supports, and character boundsOn \(e\)-cuspidal pairs of finite groups of exceptional Lie typeOn the Mackey formula for connected centre groupsTowards the Eaton-Moretó conjecture on the minimal height of charactersOn induction of class functionsOn the inductive blockwise Alperin weight condition for classical groupsJordan decomposition and real-valued characters of finite reductive groups with connected centerThe development version of the \texttt{CHEVIE} package of \texttt{GAP3}.



Cites Work


This page was built for publication: Computational proof of the Mackey formula for \(q>2\).