Bounds on finite quasiprimitive permutation groups

@article{Praeger2001BoundsOF,
  title={Bounds on finite quasiprimitive permutation groups},
  author={C. Praeger and A. Shalev},
  journal={Journal of the Australian Mathematical Society},
  year={2001},
  volume={71},
  pages={243 - 258}
}
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… Expand
Quasiprimitivity: Structure and Combinatorial Applications
  • C. Praeger
  • Computer Science, Mathematics
  • Discret. Math.
  • 2003
Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree
A theory of semiprimitive groups
Permutation Groups and Normal Subgroups
Bases of twisted wreath products
Bounds and quotient actions of innately transitive groups
  • John Bamberg
  • Mathematics
  • Journal of the Australian Mathematical Society
  • 2005
Quantifying symmetry

References

SHOWING 1-10 OF 44 REFERENCES
On the Order of Uniprimitive Permutation Groups
On the Orders of Doubly Transitive Permutation Groups, Elementary Estimates
  • L. Pyber
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. A
  • 1993
Random Permutations: Some Group-Theoretic Aspects
FINITE PERMUTATION GROUPS AND FINITE SIMPLE GROUPS
Computational complexity and the classification of finite simple groups
  • L. Babai, W. Kantor, E. Luks
  • Mathematics, Computer Science
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
...
1
2
3
4
5
...