2009arXiv (Cornell University)Open access

On the Sylow graph of a group and Sylow normalizers

Л. С. Казарин, A. Martı́nez-Pastor, M. D. Pérez‐Ramos

Open full text 0 citations

Abstract

Let $G$ be a finite group and $G_p$ 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 $A_p(G)$ is defined to be the group $N_G(G_p)/G_pC_G(G_p)$. We define the Sylow graph $Γ_A(G)$ of the group $G$, with set of vertices $π(G)$, as follows: Two vertices $p,q\inπ(G)$ form an edge of $Γ_A(G)$ if either $q\inπ(A_p(G))$ or $p\in π(A_q(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.

Open-access reader

About this research paper

What this paper is about

Let $G$ be a finite group and $G_p$ 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 $A_p(G)$ is defined to be the group $N_G(G_p)/G_pC_G(G_p)$. We define the Sylow graph $Γ_A(G)$ of the group $G$, with set of vertices $π(G)$, as follows: Two vertices $p,q\inπ(G)$ form an edge of $Γ_A(G)$ if either $q\inπ(A_p(G))$ or $p\in π(A_q(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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Let $G$ be a finite group and $G_p$ 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 $A_p(G)$ is defined to be the group $N_G(G_p)/G_pC_G(G_p)$. We define the Sylow graph $Γ_A(G)$ of the group $G$, with set of vertices $π(G)$, as follows: Two vertices $p,q\inπ(G)$ form an edge of $Γ_A(G)$ if either $q\inπ(A_p(G))$ or $p\in π(A_q(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.

Key concepts: Sylow theorems, Mathematics, Combinatorics, Finite group, Graph, p-group, Prime (order theory), Complement (music)

Related papers

Back to paper searchBrowse research topicsOriginal source
On the Sylow graph of a group and Sylow normalizers — Research Paper | ScholarLens