2000 character limit reached
On a minimal counterexample to Brauer's $k(B)$-conjecture
Published 15 Sep 2017 in math.RT and math.GR | (1709.05068v3)
Abstract: We study Brauer's long-standing $k(B)$-conjecture on the number of characters in $p$-blocks for finite quasi-simple groups and show that their blocks do not occur as a minimal counterexample for $p\ge5$ nor in the case of abelian defect. For $p=3$ we obtain that the principal 3-blocks do not provide minimal counterexamples. We also determine the precise number of irreducible characters in unipotent blocks of classical groups for odd primes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.