SearcharxivSearch

arXiv · 1810.12076

Finite groups, 2-generation and the uniform domination number

Abstract

Let $G$ be a finite $2$-generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_1, \ldots, x_k$, there exists $y \in G$ such that $G = \langle x_i, y\rangle$ for all $i$. The more restrictive notion of uniform spread, denoted $u(G)$, requires $y$ to be chosen from a fixed conjugacy class of $G$, and a theorem of Breuer, Guralnick and Kantor states that $u(G) \geqslant 2$ for every non-abelian finite simple group $G$. For any group with $u(G) \geqslant 1$, we define the uniform domination number $\gamma_u(G)$ of $G$ to be the minimal size of a subset $S$ of conjugate elements such that for each nontrivial $x \in G$ there exists $y \in S$ with $G = \langle x, y \rangle$ (in this situation, we say that $S$ is a uniform dominating set for $G$). We introduced the latter notion in a recent paper, where we used probabilistic methods to determine close to best possible bounds on $\gamma_u(G)$ for all simple groups $G$. In this paper we establish several new results on the spread, uniform spread and uniform domination number of finite groups and finite simple groups. For example, we make substantial progress towards a classification of the simple groups $G$ with $\gamma_u(G)=2$, and we study the associated probability that two randomly chosen conjugate elements form a uniform dominating set for $G$. We also establish new results concerning the $2$-generation of soluble and symmetric groups, and we present several open problems.

Explore related subjects

Keep this discovery

BibTeXRIS

Timothy C. Burness, Scott Harper. 2018-10-29. Finite groups, 2-generation and the uniform domination number. https://arxiv.org/abs/1810.12076

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