On the Sylow graph of a group and Sylow normalizers

Abstract

Let G be a finite group and Gp be a Sylow p-subgroup of G for a prime p in π(G), the set of all prime divisors of the order of G. The automiser Ap(G) is defined to be the group NG(Gp)/GpCG(Gp). We define the Sylow graph A(G) of the group G, with set of vertices π(G), as follows: Two vertices p,q∈π(G) form an edge of A(G) if either q∈π(Ap(G)) or p∈ π(Aq(G)). The following result is obtained: Theorem: Let G be a finite almost simple group. Then the graph A(G) is connected and has diameter at most 5. We also show how this result can be applied to derive information on the structure of a group from the normalizers of its Sylow subgroups.

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…