SearcharxivSearch

arXiv · 1610.01792

Binary permutation groups: alternating and classical groups

Abstract

We introduce a new approach to the study of finite binary permutation groups and, as an application of our method, we prove Cherlin's binary groups conjecture for groups with socle a finite alternating group, and for the $\mathcal{C}_1$-primitive actions of the finite classical groups. Our new approach involves the notion, defined with respect to a group action, of a `\emph{beautiful subset}'. We demonstrate how the presence of such subsets can be used to show that a given action is not binary. In particular, the study of such sets will lead to a resolution of many of the remaining open cases of Cherlin's binary groups conjecture.

Explore related subjects

Keep this discovery

BibTeXRIS

Nick Gill, Pablo Spiga. 2016-10-06. Binary permutation groups: alternating and classical groups. https://arxiv.org/abs/1610.01792

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR