2001
DOI: 10.1017/s1446788700002895
|View full text |Cite
|
Sign up to set email alerts
|

Bounds on finite quasiprimitive permutation groups

Abstract: A permutation group is said to be quasiprimitive if every nontrivial normal subgroup is transitive. Every primitive permutation group is quasiprimitive, but the converse is not true. In this paper we start a project whose goal is to check which of the classical results on finite primitive permutation groups also holds for quasiprimitive ones (possibly with some modifications). The main topics addressed here are bounds on order, minimum degree and base size, as well as groups containing special p -elements. We … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
20
0

Year Published

2003
2003
2022
2022

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(21 citation statements)
references
References 33 publications
1
20
0
Order By: Relevance
“…https://doi.org/10.1017/S1446788700009356 group containing special permutations, a bound on the base size of a quasiprimitive group, and a bound on the minimal degree of a quasiprimitive group. Praeger and Shalev also give a nice exposition of the literature in [10], which we do not repeat here.…”
Section: Generalising Praeger and Shalev's Resultsmentioning
confidence: 95%
See 1 more Smart Citation
“…https://doi.org/10.1017/S1446788700009356 group containing special permutations, a bound on the base size of a quasiprimitive group, and a bound on the minimal degree of a quasiprimitive group. Praeger and Shalev also give a nice exposition of the literature in [10], which we do not repeat here.…”
Section: Generalising Praeger and Shalev's Resultsmentioning
confidence: 95%
“…In Section 5, we give an expository summary of the definitions and elementary properties of permutational transformations. Our goal in Sections 5-8 is to state and prove a theorem which encapsulates seven generalisations of results from [10]. Finally, in Section 9, we give a complete account of the innately transitive types of quotient actions of innately transitive groups, in a similar manner to that of Praeger's [7] investigation of quotient actions of quasiprimitive groups.…”
Section: Introductionmentioning
confidence: 98%
“…A well-known result due to Jordan states that a primitive permutation group of degree n containing a cycle of prime length p with p n − 3 must contain Alt(n). This result was extended to finite quasiprimitive and finite innately transitive groups in [30] and [4] respectively. Here we show that the same result holds in the context of semiprimitive groups (of arbitrary cardinality).…”
mentioning
confidence: 91%
“…This leads to a natural generalisation where we call a permutation group quasiprimitive if each of its non-trivial normal subgroups is transitive. Many questions about permutation groups can be reduced to questions about primitive or quasiprimitive groups and they have been the focus of much attention, for example [1,8,9,10,13,14,16,17,19,23,25,26,27,28,30,31,32].Innately transitive permutation groups were introduced by Bamberg and Praeger [3] and these are the finite permutation groups G with a transitive minimal normal subgroup N. Such groups naturally occur as overgroups of quasiprimitive groups. A permutation group G is called semiregular if each point-stabiliser G ω is trivial.…”
mentioning
confidence: 99%
See 1 more Smart Citation