One corollary of description of finite groups without elements of order \(6\) (Q6587419)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: One corollary of description of finite groups without elements of order \(6\) |
scientific article; zbMATH DE number 7896800
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One corollary of description of finite groups without elements of order \(6\) |
scientific article; zbMATH DE number 7896800 |
Statements
One corollary of description of finite groups without elements of order \(6\) (English)
0 references
14 August 2024
0 references
Otto Kegel and Karl Gruenberg introduced an interesting graph, which was useful to detect the structural properties of finite groups, looking at the order of their elements.\N\NMore precisely, if \(G\) is a finite group and the set of all prime divisors of the order of \(G\) is \(\pi(G)\), the ``Gruenberg-Kegel graph'' (also known in the literature with the name of ``prime graph'') is the graph with vertices given by the elements of \(\pi(G)\) and two vertices \(p\) and \(q\) in \(\pi(G)\) are adjacent if and only if \(G\) contains an element of order \(pq\).\N\NSome connected components of this graph were described very well by \textit{M. S. Lucido} [Rend. Semin. Mat. Univ. Padova 102, 1--22 (1999; Zbl 0941.20008)] and in some of her successive contributions. Essentially the role of the connected component of this graph containing the prime \(2\) is peculiar, but about the other components there isn't a clear and uniform description of what happens in general (this is one of the ``Problems'' which are mentioned often in recent years and also in the paper under review by the authors).\N\NIt should be noted that the prime graph has been the subject of several generalizations, as illustrated by the reviewer [Adv. Pure Math. 2, No. 6, 391--396 (2012; \url{doi:10.4236/apm.2012.26058})], or by\textit{A. F. Vasil'ev} et al. [Sib. Math. J. 63, No. 5, 849--861 (2022; Zbl 1516.20055); translation from Sib. Mat. Zh. 63, No. 5, 1010--1026 (2022)] or even in the context of infinite profinite groups by \textit{W. Herfort} et al. [Topology Appl. 263, 26--43 (2019; Zbl 1442.22006)] and in many other contributions in group theory.\N\NIn the paper under review, the authors offer a description of the component of the prime graph focusing on the role of the prime \(3\) and considering the behaviour of the nonsolvable finite groups. It is interesting to note that among all the groups which are involved in their classification there are groups which possess non-trivial partitions and these were also studied by Otto Kegel (and by Petr Kontorovich, Guido Zappa and many other group theorists) long time ago with the methods of the partition theory.
0 references
prime graph
0 references
connected graph, nonsolvable groups
0 references
Gruenberg-Kegel graph
0 references
0 references