SearcharxivSearch

arXiv · 2409.15153

A character theoretic formula for base size

Abstract

A base for a permutation group $G$ acting on a set $\Omega$ is a sequence $\mathcal{B}$ of points of $\Omega$ such that the pointwise stabiliser $G_{\mathcal{B}}$ is trivial. The base size of $G$ is the size of a smallest base for $G$. We derive a character theoretic formula for the base size of a class of groups admitting a certain kind of irreducible character. Moreover, we prove a formula for enumerating the non-equivalent bases for $G$ of size $l\in\mathbb{N}$. As a consequence of our results, we present a very short, entirely algebraic proof of the formula of Mecenero and Spiga~\cite{MeSp} for the base size of the symmetric group $\mathrm{S}_n$ acting on the $k$-element subsets of $\{1,2,3,\dots,n\}$. Our methods also provide a formula for the base size of many product-type permutation groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Coen del Valle. 2024-09-23. A character theoretic formula for base size. https://arxiv.org/abs/2409.15153

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