A classification of the prime graphs of pseudo-solvable groups

DOI10.1515/JGTH-2023-0018MaRDI QIDQ6146260zbMATH OpenOpenAlexFDO

Authors Ziyu Huang, Thomas Michael Keller, Shane Kissinger, Wen Plotnick, Maya Roma, Yong Yang

Publication date 10 January 2024

Published in Journal of Group Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2211.15818

zbMATH Keywords

finite groupsprime graphssets of elements orders

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Abstract: The prime graph $Gamma(G)$ of a finite group $G$ (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of $|G|$, and $pext-q$ is an edge in $Gamma(G)$ if and only if $G$ has an element of order $pq$. Since their inception in the 1970s these graphs have been studied extensively; however, completely classifying the possible prime graphs for larger families of groups remains a difficult problem. For solvable groups such a classification was found in 2015. In this paper we go beyond solvable groups for the first time and characterize prime graphs of a more general class of groups we call pseudo-solvable. These are groups whose composition factors are either cyclic or $A_5$. The classification is based on two conditions: the vertices $2,3,5$ form a triangle in $overlineGamma(G)$ or $p,3,5$ form a triangle for some prime $peq2$.

Review text

The prime graph \(\Gamma(G)\) of a finite group \(G\) has as its vertices the prime divisors of the order of \(G\), and \(p-q\) is an edge in \(\Gamma(G)\) if and only if \(G\) has an element of order \(pq.\) \textit{A. Gruber} et al. [J. Algebra 442, 397--422 (2015; Zbl 1331.20029)] studied the prime graphs of solvable groups and obtained the following characterization: A simple graph is isomorphic to the prime graph of a solvable group if and only if the complement of the graph is \(3\)-colorable and triangle-free. The authors of this paper take the first step into the realm of non-solvable groups by completely characterizing the prime graphs of what they call pseudo-solvable groups. These are finite groups whose composition factors are either cyclic or isomorphic to the alternating group on five elements. The classification is based on two conditions: The vertices \(\{2; 3; 5\}\) form a triangle in the complement of \(\Gamma(G)\) or \(\{p, 3, 5\}\) form a triangle for some prime \(p \neq 2.\)

Recommendations

• A characterization of the prime graphs of solvable groups.
• The prime graphs of groups with arithmetically small composition factors
• A generalization of prime graphs of finite groups
• Finite groups whose prime graphs do not contain triangles. I
• The prime graphs of some classes of finite groups

Cites work

• A characterization of the prime graphs of solvable groups.
• Finite group theory.
• Groups Having Strongly Self-Centralizing 3-Centralizers
• scientific article; zbMATH DE number 3526920 (Why is no real title available?)
• On Brauer's \(k(B)\)-problem
• Prime graph components of finite groups
• Solvable groups with a small number of prime divisors in the element orders
• The classification of the finite simple groups
• The prime graphs of some classes of finite groups

Cited in

(2)

• The prime graphs of groups with arithmetically small composition factors
• Classifying prime graphs of finite groups -- a methodical approach

This page was built for publication: A classification of the prime graphs of pseudo-solvable groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146260)