On the orders of doubly transitive permutation groups, elementary estimates
DOI10.1016/0097-3165(93)90053-BzbMATH Open0781.20002MaRDI QIDQ1803878FDOQ1803878
Authors: Laszló Pyber
Publication date: 29 June 1993
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Recommendations
greedy algorithmfinite permutation grouporder estimatesminimal degreedoubly transitivepointwise stabilizerbase of permutation groups
Multiply transitive finite groups (20B20) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Asymptotic results on counting functions for algebraic and topological structures (11N45)
Cites Work
- Title not available (Why is that?)
- Finite Permutation Groups and Finite Simple Groups
- On the order of uniprimitive permutation groups
- On minimal degrees and base sizes of primitive permutation groups
- On the orders of Primitive Permutation Groups
- On the order of doubly transitive permutation groups
- On the degree of transitivity of permutation groups: A short proof
- On the length of subgroup chains in the symmetric group
- Permutation groups without exponentially many orbits on the power set
- On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group
Cited In (39)
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
- On the orders of Transitive Permutation Groups
- Base sizes of primitive groups: bounds with explicit constants
- Title not available (Why is that?)
- Irredundant bases for finite groups of Lie type
- 2-arc-transitive Cayley graphs on alternating groups
- ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP
- Permutation groups without exponentially many orbits on the power set
- Base sizes of primitive permutation groups
- Base sizes for primitive groups with soluble stabilisers
- On an estimate for the order of primitive permutation groups
- On the diameter of permutation groups.
- Growth and expansion in algebraic groups over finite fields
- How many elements are needed to generate a finite group with good probability?
- Title not available (Why is that?)
- Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
- Permutation groups, minimal degrees and quantum computing.
- A theory of semiprimitive groups
- Bounds on finite quasiprimitive permutation groups
- Bases of primitive linear groups.
- A proof of Pyber's base size conjecture
- On a class of doubly, but not triply transitive permutation groups
- The minimum length of a base for the symmetric group acting on partitions
- On short expressions for cosets of permutation subgroups
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed
- Growth in groups: ideas and perspectives
- On the orders of primitive groups
- On the automorphism groups of strongly regular graphs. II.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic enumeration of Cayley digraphs
- On minimal degrees and base sizes of primitive permutation groups
- Tame automorphism groups of polynomial rings with property (T) and infinitely many alternating group quotients
- Asymptotic results for primitive permutation groups
- Fixed point polynomials of permutation groups.
- Minimal degree, base size, order: selected topics on primitive permutation groups
- On relational complexity and base size of finite primitive groups
- Dixon's asymptotic without the classification of finite simple groups
- On base sizes for symmetric groups
This page was built for publication: On the orders of doubly transitive permutation groups, elementary estimates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803878)