SearcharxivSearch

arXiv · 2509.11958

Non-split sharply 2-transitive groups of bounded exponent

Abstract

We construct here the first known examples of non-split sharply 2-transitive groups of bounded exponent in odd positive characteristic for every large enough prime $p \equiv 3 \pmod{4}$. In fact, we show that there are countably many pairwise non-isomorphic countable non-split sharply 2-transitive groups of characteristic $p$ for each such $p$. Furthermore, we construct non-periodic non-split sharply 2-transitive groups (of these same characteristics) with centralizers of involutions of bounded exponent. As a consequence of these results, we answer two open questions about sharply 2-transitive and 2-transitive permutation groups. The constructions of groups as announced rely on iteratively applying (geometric) small cancellation methods in the presence of involutions. To that end, we develop a method to control some small cancellation parameters in the presence of even-order torsion.

Explore related subjects

Keep this discovery

BibTeXRIS

Marco Amelio. 2025-09-15. Non-split sharply 2-transitive groups of bounded exponent. https://arxiv.org/abs/2509.11958

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