The distinguishing number of quasiprimitive and semiprimitive groups
Alice Devillers, Scott Harper, Luke Morgan

TL;DR
This paper investigates the distinguishing number of certain permutation groups, proving that most quasiprimitive and semiprimitive groups have a distinguishing number of two, with a specific exception.
Contribution
It extends previous work by showing that all imprimitive quasiprimitive groups and most non-quasiprimitive semiprimitive groups have a distinguishing number of two, except for one specific case.
Findings
All imprimitive quasiprimitive groups have distinguishing number two.
All non-quasiprimitive semiprimitive groups have distinguishing number two.
The group GL(2,3) acting on 8 vectors has distinguishing number three.
Abstract
The distinguishing number of is the smallest size of a partition of such that only the identity of fixes all the parts of the partition. Extending earlier results of Cameron, Neumann, Saxl and Seress on the distinguishing number of finite primitive groups, we show that all imprimitive quasiprimitive groups have distinguishing number two, and all non-quasiprimitive semiprimitive groups have distinguishing number two, except for acting on the eight non-zero vectors of , which has distinguishing number three.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Finite Group Theory Research · graph theory and CDMA systems
