Finite primitive groups and edge-transitive hypergraphs

DOI10.1007/s10801-015-0651-9zbMath1336.05061arXiv1407.0953OpenAlexW1648017160MaRDI QIDQ289049

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

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

Related Items (3)

Orbit closed permutation groups, relation groups, and simple groups ⋮ Boolean lattices in finite alternating and symmetric groups ⋮ Edge-primitive graphs of prime power order

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orbit equivalence and permutation groups defined by unordered relations.
• Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
• Overgroups of primitive groups. II.
• On groups with no regular orbits on the set of subsets
• A characterization of some locally finite simple groups of Lie type
• A classification of the maximal subgroups of the finite alternating and symmetric groups
• On the minimal degree of a primitive permutation group
• The Magma algebra system. I: The user language
• \(k\)-homogeneous groups
• The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
• OVERGROUPS OF PRIMITIVE GROUPS
• Minimal Degrees of Primitive Permutation Groups, with an Application to Monodromy Groups of Covers of Riemann Surfaces
• The Inclusion Problem for Finite Primitive Permutation Groups
• Primitive Groups with no Regular Orbits on the Set of Subsets
• The probability of generating the symmetric group

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