Finite primitive groups and edge-transitive hypergraphs

DOI10.1007/S10801-015-0651-9MaRDI QIDQ289049zbMATH OpenOpenAlexFDO

Authors Pablo Spiga

Publication date 27 May 2016

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

uniform hypergraphautomorphism group of set systemsedge-transitiveprimitive group

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Hypergraphs (05C65) Primitive groups (20B15) Other matrix groups over finite fields (20H30)

Abstract: We determine all finite primitive groups that are automorphism groups of edge-transitive hypergraphs. This gives an answer to a problem proposed by Babai and Cameron

Recommendations

• Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
• On edge-primitive 2-arc-transitive graphs
• The finite primitive groups with soluble stabilizers, and the edge-primitive \(s\)-arc transitive graphs.
• Finite vertex primitive 2-arc transitive graphs admitting a two-dimensional linear group
• One class of primitive 2-arc transitive graphs.

Cites work

• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 4055862 (Why is no real title available?)
• scientific article; zbMATH DE number 46357 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• A characterization of some locally finite simple groups of Lie type
• A classification of the maximal subgroups of the finite alternating and symmetric groups
• Minimal Degrees of Primitive Permutation Groups, with an Application to Monodromy Groups of Covers of Riemann Surfaces
• Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
• OVERGROUPS OF PRIMITIVE GROUPS
• On groups with no regular orbits on the set of subsets
• On the minimal degree of a primitive permutation group
• Orbit equivalence and permutation groups defined by unordered relations.
• Overgroups of primitive groups. II.
• Primitive Groups with no Regular Orbits on the Set of Subsets
• The Inclusion Problem for Finite Primitive Permutation Groups
• The Magma algebra system. I: The user language
• The maximal subgroups of the low-dimensional finite classical groups.
• The probability of generating the symmetric group
• k-homogeneous groups

Cited in

(9)

• scientific article; zbMATH DE number 6719668 (Why is no real title available?)
• The finite primitive groups with soluble stabilizers, and the edge-primitive \(s\)-arc transitive graphs.
• Primitive Permutation Groups with a Common Suborbit, and Edge-Transitive Graphs
• Orbit closed permutation groups, relation groups, and simple groups
• Geometric groups of second order and related combinatorial structures
• Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
• Boolean lattices in finite alternating and symmetric groups
• Edge-primitive graphs of prime power order
• How far can edge transitivity in hypergraphs be?

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Finite primitive groups and edge-transitive hypergraphs

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