The block graph of a finite group
Julian Brough, Yanjun Liu, Alessandro Paolini

TL;DR
This paper introduces the block graph of a finite group based on principal block intersections, determines its structure for simple groups, and uses it to characterize group properties like solvability and nilpotency.
Contribution
It defines the block graph for finite groups, characterizes it for simple groups, and links it to group solvability and nilpotency criteria.
Findings
Block graphs are complete for all simple groups except J1 and J4.
The Steinberg character's placement in principal blocks is characterized.
Group solvability and nilpotency can be inferred from block intersection properties.
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 , whose vertices are the prime divisors of and there is an edge between two vertices if and only if the principal - and -blocks of have a nontrivial common complex irreducible character of . Then we determine the block graphs of finite simple groups, which turn out to be complete except those of and . 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 -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,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
