Connectivity of p-subgroup posets with irreducible characters

Abstract

Let G be a finite group. For a prime p and an integer e ≥ 0, we denote by p,e(G) the set of all pairs (H, ), where H is a p-subgroup of G of order greater than pe and is a complex irreducible character of H. In this paper, we investigate the connected components of the poset p,e(G). For the case e = 0, we prove that p,0(G) is disconnected if and only if either G has a strongly p-embedded subgroup, or every Sylow p-subgroup of G contains a unique subgroup of order p. Furthermore, for e = 1 and G a p-group, we show that the number of connected components of p,1(G) equals the order of the intersection of all subgroups of G of order p2.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…