Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
3 tokens/sec
DeepSeek R1 via Azure Pro
51 tokens/sec
2000 character limit reached

On a minimal counterexample to Brauer's $k(B)$-conjecture (1709.05068v3)

Published 15 Sep 2017 in math.RT and math.GR

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.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)