2000
DOI: 10.1007/bf02674599
|View full text |Cite
|
Sign up to set email alerts
|

Recognition of alternating groups of prime degree from their element orders

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
53
0

Year Published

2005
2005
2017
2017

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 82 publications
(54 citation statements)
references
References 5 publications
1
53
0
Order By: Relevance
“…Williams and Kondrat'ev (see [11,4,5]), proved a series of important results on prime graphs. We apply these results to prove Theorem A.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Williams and Kondrat'ev (see [11,4,5]), proved a series of important results on prime graphs. We apply these results to prove Theorem A.…”
Section: Introductionmentioning
confidence: 99%
“…According to the classification theorem of finite simple groups and [4,5,11,12], we can list the order components of finite simple groups with disconnected prime graphs as in Tables 1-3 in [1].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…By Lemma 1 in [22] there are at least three distinct primes p i such that 2 p−1 < p i < 2 p − 1. Of course we have p i | |A p |.…”
Section: Lemma 6 Let R Be a Prime Divisor Of Amentioning
confidence: 97%
“…In this paper, we will use this result to solve the above problem; our main result is Corollary 4 below. This follows from our first theorem, which treats the case where H is a maximal subgroup of G. (In the final column of Table 1, we record the number of connected components in Γ(G), denoted by s(G), which is taken from [11,.) Theorem 1.…”
Section: Introductionmentioning
confidence: 99%