2015
DOI: 10.1090/s0002-9947-2015-06293-x
|View full text |Cite
|
Sign up to set email alerts
|

On the maximum orders of elements of finite almost simple groups and primitive permutation groups

Abstract: We determine upper bounds for the maximum order of an element of a finite almost simple group with socle T in terms of the minimum index m(T ) of a maximal subgroup of T : for T not an alternating group we prove that, with finitely many exceptions, the maximum element order is at most m(T ). Moreover, apart from an explicit list of groups, the bound can be reduced to m(T )/4. These results are applied to determine all primitive permutation groups on a set of size n that contain permutations of order greater th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
125
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 63 publications
(126 citation statements)
references
References 40 publications
1
125
0
Order By: Relevance
“…Since g has no two cycles of same length, the proof of [10,Corollary 2.7] yields that |g| divides n = (q Since |g| is odd, we must have r = 2. Moreover, as |g| is a power of an odd prime, Zsigmondy's theorem yields that d = 2.…”
Section: More On Symmetric Groupsmentioning
confidence: 99%
See 1 more Smart Citation
“…Since g has no two cycles of same length, the proof of [10,Corollary 2.7] yields that |g| divides n = (q Since |g| is odd, we must have r = 2. Moreover, as |g| is a power of an odd prime, Zsigmondy's theorem yields that d = 2.…”
Section: More On Symmetric Groupsmentioning
confidence: 99%
“…A maximal subgroup H of G containing g is clearly transitive, and is either imprimitive or primitive. If H is primitive then by [10 − 1)). We claim that d > 2.…”
Section: If Soc(h )mentioning
confidence: 99%
“…Let π e (G) = {|g| : g ∈ G} and meo(G) = max{|g| : g ∈}; that is, π e (G) is the set of orders of elements of G and meo(G) is the maximum element order of G (see [11]). A group G is called a 2-Frobenius group if G has a normal series 1 ⊆ H ⊆ K ⊆ G such that K and G/H are Frobenius groups with kernels H and K/H respectively.…”
Section: Denote By T (G) = {π I (G) | 1 I T(g)} the Set Of All Connecmentioning
confidence: 99%
“…In addition, the two largest element orders of simple groups of Lie type of odd characteristic are listed in [17]. In [11], Guest, Morris, Praeger and Spiga determine the upper bounds of meo(S) for S a finite almost simple group. Moreover, these results are applied to determine the primitive permutation groups on a set of size n that contain permutations of order greater than or equal to n/4.…”
Section: Denote By T (G) = {π I (G) | 1 I T(g)} the Set Of All Connecmentioning
confidence: 99%
See 1 more Smart Citation