SearcharxivSearch

arXiv · 2303.14290

Base sizes of primitive groups of diagonal type

Abstract

Let $G$ be a permutation group on a finite set $\Omega$. The base size of $G$ is the minimal size of a subset of $\Omega$ with trivial pointwise stabiliser in $G$. In this paper, we extend earlier work of Fawcett by determining the precise base size of every finite primitive permutation group of diagonal type. In particular, this is the first family of primitive groups arising in the O'Nan-Scott theorem for which the exact base size has been computed in all cases. Our methods also allow us to determine all the primitive groups of diagonal type with a unique regular suborbit.

Explore related subjects

Keep this discovery

BibTeXRIS

Hong Yi Huang. 2023-03-24. Base sizes of primitive groups of diagonal type. https://arxiv.org/abs/2303.14290

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