Most primitive groups are full automorphism groups of edge-transitive hypergraphs.

DOI10.1016/J.JALGEBRA.2014.09.002MaRDI QIDQ468722zbMATH OpenOpenAlexFDO

Authors László Babai, Peter J. Cameron

Publication date 7 November 2014

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.6739

zbMATH Keywords

primitive permutation groupsautomorphism groupsedge-transitive hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Primitive groups (20B15) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Probabilistic methods in group theory (20P05)

Abstract: We prove that, for a primitive permutation group G acting on a set of size n, other than the alternating group, the probability that Aut(X,Y^G) = G for a random subset Y of X, tends to 1 as n tends to infinity. So the property of the title holds for all primitive groups except the alternating groups and finitely many others. This answers a question of M. Klin. Moreover, we give an upper bound n^{1/2+epsilon} for the minimum size of the edges in such a hypergraph. This is essentially best possible.

Recommendations

• Finite primitive groups and edge-transitive hypergraphs
• Most switching classes with primitive automorphism groups contain graphs with trivial groups
• Automorphism groups of primitive distance-bitransitive graphs are almost simple
• Primitive Permutation Groups with a Common Suborbit, and Edge-Transitive Graphs
• The finite primitive groups with soluble stabilizers, and the edge-primitive \(s\)-arc transitive graphs.
• On graphs with edge-transitive automorphism groups
• Primitive half-transitive graphs constructed from the symmetric groups of prime degrees

Cites work

• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• scientific article; zbMATH DE number 1004943 (Why is no real title available?)
• Asymmetric graphs
• Chains of subgroups in symmetric groups
• Faster canonical forms for primitive coherent configurations (extended abstract)
• Finite Permutation Groups and Finite Simple Groups
• Maximal subgroups of symmetric groups
• On a conjecture of G. E. Wall.
• On groups with no regular orbits on the set of subsets
• On minimal degrees and base sizes of primitive permutation groups
• On the length of subgroup chains in the symmetric group
• On the order of doubly transitive permutation groups
• On the order of uniprimitive permutation groups
• On the orders of doubly transitive permutation groups, elementary estimates
• On the orders of primitive groups
• Primitive Groups with no Regular Orbits on the Set of Subsets
• The 2-Transitive Permutation Representations of the Finite Chevalley Groups
• The probability of generating the symmetric group
• Transitivity of finite permutation groups on unordered sets

Cited in

(4)

• Graphical representations of cyclic permutation groups
• Geometric groups of second order and related combinatorial structures
• Finite primitive groups and edge-transitive hypergraphs
• Asymptotic results for primitive permutation groups

This page was built for publication: Most primitive groups are full automorphism groups of edge-transitive hypergraphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468722)