The distinguishing number of quasiprimitive and semiprimitive groups
From MaRDI portal
Publication:2311089
DOI10.1007/S00013-019-01324-7OpenAlexW2888316897MaRDI QIDQ2311089FDOQ2311089
Authors: Alice Devillers, Luke Morgan, Scott Harper
Publication date: 10 July 2019
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.08705
Recommendations
General theory for finite permutation groups (20B05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)
Cites Work
- The Magma algebra system. I: The user language
- On groups with no regular orbits on the set of subsets
- Orbits of permutation groups on the power set
- The distinguishing number of the direct product and wreath product action.
- Base size, metric dimension and other invariants of groups and graphs
- Primitive Groups with no Regular Orbits on the Set of Subsets
- The classification of the finite simple groups
- Title not available (Why is that?)
- Constructing transitive permutation groups.
- An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
- Title not available (Why is that?)
- On graph-restrictive permutation groups
- Distinguishing labellings of group action on vector spaces and graphs
- Title not available (Why is that?)
- On groups with every normal subgroup transitive or semiregular.
- The Transitive Permutation Groups of Degree 32
- The primitive permutation groups of degree less than 2500.
- Regular orbits of permutation groups on the power set
- Bounds on finite quasiprimitive permutation groups
- The maximum distinguishing number of a group
- A theory of semiprimitive groups
- Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree
- A proof of Pyber's base size conjecture
- On the base size for the symmetric group acting on subsets.
Cited In (7)
- Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree
- Comparing quasi-finitely axiomatizable and prime groups
- Orbit closed permutation groups, relation groups, and simple groups
- The distinguishing number of quasiprimitive and semiprimitive groups
- Bounding the distinguishing number of infinite graphs and permutation groups
- Distinguishability of a Semi-Group by a Machine
- Bases of twisted wreath products
Uses Software
This page was built for publication: The distinguishing number of quasiprimitive and semiprimitive groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311089)