Derangements in intransitive groups
David Ellis, Scott Harper

TL;DR
This paper investigates conditions under which intransitive permutation groups contain derangements, proposing conjectures and proving results for various classes of groups, with implications for group theory and permutation combinatorics.
Contribution
It introduces a conjecture about derangements in intransitive groups with two equal-sized orbits and proves it in several important cases, advancing understanding of derangements and subgroup unions.
Findings
Proves the conjecture for primitive, soluble, almost simple groups, and groups of order ≤ 50000.
Establishes the conjecture when one subgroup is maximal.
Provides a linear variant related to Isbell's conjecture and explores connections to permutation families and polynomial roots.
Abstract
Let be a nontrivial permutation group of degree . If is transitive, then a theorem of Jordan states that has a derangement. Equivalently, a finite group is never the union of conjugates of a proper subgroup. If is intransitive, then may fail to have a derangement, and this can happen even if has only two orbits, both of which have size . However, we conjecture that if has two orbits of size exactly then does have a derangement, and we prove this conjecture when acts primitively on at least one of the orbits. Equivalently, we conjecture that a finite group is never the union of conjugates of two proper subgroups of the same order, and we prove this conjecture when at least one of the subgroups is maximal. (Feldman also implicitly raised this conjecture on StackExchange.) We also prove the conjecture for soluble groups, almost…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Advanced Algebra and Geometry · graph theory and CDMA systems
