The block graph of a finite group

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≠ 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 J1 and J4. 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…