Orbit-equivalent infinite permutation groups
Debbie Lockett, Dugald Macpherson

TL;DR
This paper proves that for certain infinite permutation groups, orbit-equivalence combined with primitivity but not 2-transitivity implies the groups are identical, clarifying the structure of such groups.
Contribution
It establishes a new uniqueness result for orbit-equivalent primitive but not 2-transitive infinite permutation groups.
Findings
Orbit-equivalence plus primitivity implies group equality under specified conditions.
Provides a characterization of infinite permutation groups with certain orbit properties.
Clarifies the structure of primitive but not 2-transitive groups in the infinite case.
Abstract
Let G,H be closed permutation groups on an infinite set X, with H a subgroup of G. It is shown that if G and H are orbit-equivalent, that is, have the same orbits on the collection of finite subsets of X, and G is primitive but not 2-transitive, then G=H.
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
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
