Papers
Topics
Authors
Recent
Search
2000 character limit reached

The block graph of a finite group

Published 24 May 2017 in math.RT and math.GR | (1705.08685v2)

Abstract: This paper studies intersections of principal blocks of a finite group with respect to different primes. We first define the block graph of a finite group $G$, whose vertices are the prime divisors of $|G|$ and there is an edge between two vertices $p\neq q$ if and only if the principal $p$- and $q$-blocks of $G$ have a nontrivial common complex irreducible character of $G$. Then we determine the block graphs of finite simple groups, which turn out to be complete except those of $J_1$ and $J_4$. Also, we determine exactly when the Steinberg character of a finite simple group of Lie type lies in a principal block. Based on the above investigation, we obtain a criterion for the $p$-solvability of a finite group which in particular leads to an equivalent condition for the solvability of a finite group. Thus, together with two recent results of Bessenrodt and Zhang, the nilpotency, $p$-nilpotency and solvability of a finite group can be characterized by intersections of principal blocks of some quotient groups.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Collections

Sign up for free to add this paper to one or more collections.