2015
DOI: 10.1007/s00229-015-0795-x
|View full text |Cite
|
Sign up to set email alerts
|

Primitive permutation groups and derangements of prime power order

Abstract: Abstract. Let G be a transitive permutation group on a finite set of size at least 2. By a well known theorem of Fein, Kantor and Schacher, G contains a derangement of prime power order. In this paper, we study the finite primitive permutation groups with the extremal property that the order of every derangement is an r -power, for some fixed prime r . First we show that these groups are either almost simple or affine, and we determine all the almost simple groups with this property. We also prove that an affi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
3
2

Relationship

3
5

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 48 publications
0
9
0
Order By: Relevance
“…Now assume r = 2f + 1. By arguing as in the proof of [9,Lemma 4.6] we deduce that f = 2 m is a 2-power, so r = 2 m+1 + 1 is a Fermat prime and thus m + 1 = 2 l for some l 0.…”
Section: Rank One Groups Of Lie Typementioning
confidence: 72%
See 2 more Smart Citations
“…Now assume r = 2f + 1. By arguing as in the proof of [9,Lemma 4.6] we deduce that f = 2 m is a 2-power, so r = 2 m+1 + 1 is a Fermat prime and thus m + 1 = 2 l for some l 0.…”
Section: Rank One Groups Of Lie Typementioning
confidence: 72%
“…Proposition 3.6. For k 4, either |Ω| is divisible by distinct primes r, s > k, or (n, k) = (12, 5), (9,4).…”
Section: 1mentioning
confidence: 99%
See 1 more Smart Citation
“…Throughout the section we let n be a positive integer and q = p f such that p is prime and f 1. Our first result is [10,Lemma 2.6].…”
Section: Number Theoretic Preliminariesmentioning
confidence: 89%
“…By [19,Lemma 2.6], there are no solutions to the equation 2 f − 1 = r ℓ with ℓ 2, so q − 1 must be divisible by at least two distinct primes and thus r(r + 2) q − 1. This implies that r √ q − 1 and one can now check that (1) holds.…”
Section: Almost Simple Groupsmentioning
confidence: 99%