SearcharxivSearch

arXiv · 2102.02190

Bases of twisted wreath products

Abstract

We study the base sizes of finite quasiprimitive permutation groups of twisted wreath type, which are precisely the finite permutation groups with a unique minimal normal subgroup that is also non-abelian, non-simple and regular. Every permutation group of twisted wreath type is permutation isomorphic to a twisted wreath product $G=T^k{:}P$ acting on its base group $\Omega=T^k$, where $T$ is some non-abelian simple group and $P$ is some group acting transitively on $\boldsymbol{k}=\{1,\ldots,k\}$ with $k\geq 2$. We prove that if $G$ is primitive on $\Omega$ and $P$ is quasiprimitive on $\boldsymbol{k}$, then $G$ has base size 2. We also prove that the proportion of pairs of points that are bases for $G$ tends to 1 as $|G|\to \infty$ when $G$ is primitive on $\Omega$ and $P$ is primitive on $\boldsymbol{k}$. Lastly, we determine the base size of any quasiprimitive group of twisted wreath type up to four possible values (and three in the primitive case). In particular, we demonstrate that there are many families of primitive groups of twisted wreath type with arbitrarily large base sizes.

Explore related subjects

Keep this discovery

BibTeXRIS

Joanna B. Fawcett. 2021-02-03. Bases of twisted wreath products. https://doi.org/10.1016/j.jalgebra.2021.11.051

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