Groups with the same order and degree pattern. (Q424304): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / review text
 
The well-known notion of the prime graph \(\Gamma(G)\) of a finite group \(G\) has many important applications to the study of arithmetical properties of finite groups. In particular, results on the prime graph of finite simple groups are used in the investigations of the problem of the recognition of finite almost simple groups by their orders and some properties of their prime graphs. Let \(G\) be a finite group and \(\pi(|G|)=\{p_1,\dots,p_k\}\) with \(p_1<p_2<\cdots<p_k\). For \(p\in\pi(|G|)\), let \(\deg(p)\) be the degree (valency) of the vertex \(p\) in the graph \(\Gamma(G)\). According to \textit{A. R. Moghaddamfar, A. R. Zokayi} and \textit{M. R. Darafsheh} [Algebra Colloq. 12, No. 3, 431-442 (2005; Zbl 1072.20015)], we define \(D(G)=(\deg(p_1),\dots,\deg(p_k))\), which is called the degree pattern of \(G\). The group \(G\) is called \(k\)-fold OD-characterizable if there exist exactly \(k\) non-isomorphic finite groups with the same order and the same pattern as \(G\). Usually, a 1-fold OD-characterizable group is simply called an OD-characterizable group. In the present paper, the authors prove that the alternating groups \(A_m\) and \(A_{m+1}\) for \(m\in\{27, 35, 51, 57, 65, 77, 87, 93, 95\}\) are OD-characterizable, while their automorphism groups are 3-fold OD-characterizable. It is also shown that the symmetric groups \(S_{m+2}\) for \[ m\in\{7, 13, 19, 23, 31, 37, 43, 47, 53, 61, 67, 73, 79, 83, 89, 97\} \] are 3-fold OD-characterizable. From this, the following theorem is derived: If \(m\) is a natural number such that \(m\leq 100\) then one of the following holds: (a) if \(m\neq 10\), then the alternating groups \(A_m\) are OD-characterizable, while the symmetric groups \(S_m\) are OD-characterizable or 3-fold OD-characterizable; (b) the alternating group \(A_{10}\) is 2-fold OD-characterizable; (c) the symmetric group \(S_{10}\) is 8-fold OD-characterizable. This theorem completes the study of OD-characterizability of groups \(A_m\) and \(S_m\) for \(m\leq 100\).
Property / review text: The well-known notion of the prime graph \(\Gamma(G)\) of a finite group \(G\) has many important applications to the study of arithmetical properties of finite groups. In particular, results on the prime graph of finite simple groups are used in the investigations of the problem of the recognition of finite almost simple groups by their orders and some properties of their prime graphs. Let \(G\) be a finite group and \(\pi(|G|)=\{p_1,\dots,p_k\}\) with \(p_1<p_2<\cdots<p_k\). For \(p\in\pi(|G|)\), let \(\deg(p)\) be the degree (valency) of the vertex \(p\) in the graph \(\Gamma(G)\). According to \textit{A. R. Moghaddamfar, A. R. Zokayi} and \textit{M. R. Darafsheh} [Algebra Colloq. 12, No. 3, 431-442 (2005; Zbl 1072.20015)], we define \(D(G)=(\deg(p_1),\dots,\deg(p_k))\), which is called the degree pattern of \(G\). The group \(G\) is called \(k\)-fold OD-characterizable if there exist exactly \(k\) non-isomorphic finite groups with the same order and the same pattern as \(G\). Usually, a 1-fold OD-characterizable group is simply called an OD-characterizable group. In the present paper, the authors prove that the alternating groups \(A_m\) and \(A_{m+1}\) for \(m\in\{27, 35, 51, 57, 65, 77, 87, 93, 95\}\) are OD-characterizable, while their automorphism groups are 3-fold OD-characterizable. It is also shown that the symmetric groups \(S_{m+2}\) for \[ m\in\{7, 13, 19, 23, 31, 37, 43, 47, 53, 61, 67, 73, 79, 83, 89, 97\} \] are 3-fold OD-characterizable. From this, the following theorem is derived: If \(m\) is a natural number such that \(m\leq 100\) then one of the following holds: (a) if \(m\neq 10\), then the alternating groups \(A_m\) are OD-characterizable, while the symmetric groups \(S_m\) are OD-characterizable or 3-fold OD-characterizable; (b) the alternating group \(A_{10}\) is 2-fold OD-characterizable; (c) the symmetric group \(S_{10}\) is 8-fold OD-characterizable. This theorem completes the study of OD-characterizability of groups \(A_m\) and \(S_m\) for \(m\leq 100\). / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Anatoli Kondrat'ev / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20D06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20D60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6040092 / rank
 
Normal rank
Property / zbMATH Keywords
 
finite groups
Property / zbMATH Keywords: finite groups / rank
 
Normal rank
Property / zbMATH Keywords
 
alternating groups
Property / zbMATH Keywords: alternating groups / rank
 
Normal rank
Property / zbMATH Keywords
 
symmetric groups
Property / zbMATH Keywords: symmetric groups / rank
 
Normal rank
Property / zbMATH Keywords
 
prime graphs
Property / zbMATH Keywords: prime graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
degree patterns
Property / zbMATH Keywords: degree patterns / rank
 
Normal rank
Property / zbMATH Keywords
 
OD-characterizability
Property / zbMATH Keywords: OD-characterizability / rank
 
Normal rank
Property / zbMATH Keywords
 
order components
Property / zbMATH Keywords: order components / rank
 
Normal rank
Property / zbMATH Keywords
 
sets of element orders
Property / zbMATH Keywords: sets of element orders / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11425-011-4314-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001266008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple groups which are 2-fold OD-characterizable. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Some Finite Simple Groups Through Their Orders and Degree Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3708174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5662096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing alternating groups \(A_{p+3}\) for certain primes \(p\) by their orders and degree patterns. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3032470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of alternating groups of prime degree from their element orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime graph components of finite almost simple groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups with complete prime graph connected components / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set of orders of elements in a finite group / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the OD-Characterizability of a Finite Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Finite Simple Groups by the Degrees of Vertices of Their Prime Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Finite Groups Through Order and Degree Pattern / rank
 
Normal rank
Property / cites work
 
Property / cites work: OD-Characterization of Certain Finite Groups Having Connected Prime Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: OD-characterization of alternating and symmetric groups of degrees 16 and 22. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adjacency Criterion for the Prime Graph of a Finite Simple Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime graph components of finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of finite groups by the prime graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite simple groups with narrow prime spectrum. / rank
 
Normal rank
Property / cites work
 
Property / cites work: CHARACTERIZATION OF THE PROJECTIVE GENERAL LINEAR GROUPS PGL(2,q) BY THEIR ORDERS AND DEGREE PATTERNS / rank
 
Normal rank
Property / cites work
 
Property / cites work: OD-characterization of all simple groups whose orders are less than \(10^8\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3057336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OD-Characterization of Simple K<sub>4</sub>-Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3570843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OD-characterization of almost simple groups related to \(U_3(5)\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: OD-characterization of almost simple groups related to \(U_6(2)\). / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:35, 5 July 2024

scientific article
Language Label Description Also known as
English
Groups with the same order and degree pattern.
scientific article

    Statements

    Groups with the same order and degree pattern. (English)
    0 references
    31 May 2012
    0 references
    The well-known notion of the prime graph \(\Gamma(G)\) of a finite group \(G\) has many important applications to the study of arithmetical properties of finite groups. In particular, results on the prime graph of finite simple groups are used in the investigations of the problem of the recognition of finite almost simple groups by their orders and some properties of their prime graphs. Let \(G\) be a finite group and \(\pi(|G|)=\{p_1,\dots,p_k\}\) with \(p_1<p_2<\cdots<p_k\). For \(p\in\pi(|G|)\), let \(\deg(p)\) be the degree (valency) of the vertex \(p\) in the graph \(\Gamma(G)\). According to \textit{A. R. Moghaddamfar, A. R. Zokayi} and \textit{M. R. Darafsheh} [Algebra Colloq. 12, No. 3, 431-442 (2005; Zbl 1072.20015)], we define \(D(G)=(\deg(p_1),\dots,\deg(p_k))\), which is called the degree pattern of \(G\). The group \(G\) is called \(k\)-fold OD-characterizable if there exist exactly \(k\) non-isomorphic finite groups with the same order and the same pattern as \(G\). Usually, a 1-fold OD-characterizable group is simply called an OD-characterizable group. In the present paper, the authors prove that the alternating groups \(A_m\) and \(A_{m+1}\) for \(m\in\{27, 35, 51, 57, 65, 77, 87, 93, 95\}\) are OD-characterizable, while their automorphism groups are 3-fold OD-characterizable. It is also shown that the symmetric groups \(S_{m+2}\) for \[ m\in\{7, 13, 19, 23, 31, 37, 43, 47, 53, 61, 67, 73, 79, 83, 89, 97\} \] are 3-fold OD-characterizable. From this, the following theorem is derived: If \(m\) is a natural number such that \(m\leq 100\) then one of the following holds: (a) if \(m\neq 10\), then the alternating groups \(A_m\) are OD-characterizable, while the symmetric groups \(S_m\) are OD-characterizable or 3-fold OD-characterizable; (b) the alternating group \(A_{10}\) is 2-fold OD-characterizable; (c) the symmetric group \(S_{10}\) is 8-fold OD-characterizable. This theorem completes the study of OD-characterizability of groups \(A_m\) and \(S_m\) for \(m\leq 100\).
    0 references
    finite groups
    0 references
    alternating groups
    0 references
    symmetric groups
    0 references
    prime graphs
    0 references
    degree patterns
    0 references
    OD-characterizability
    0 references
    order components
    0 references
    sets of element orders
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers