Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2001.04748

Invariable generation and wreath products

Charles Garnet Cox
View original source ↗Read source document ↗Export metadata ↓

Abstract

Invariable generation is a topic that has predominantly been studied for finite groups. In 2014, Kantor, Lubotzky, and Shalev produced extensive tools for investigating invariable generation for infinite groups. Since their paper, various authors have investigated the property for particular infinite groups or families of infinite groups. A group is invariably generated by a subset $S$ if replacing each element of $S$ with any of its conjugates still results in a generating set for $G$. In this paper we investigate how this property behaves with respect to wreath products. Our main work is to deal with the case where the base of $G\wr_X H$ is not invariably generated. We see both positive and negative results here depending on $H$ and its action on $X$.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Charles Garnet Cox. 2020-01-14. Invariable generation and wreath products. https://arxiv.org/abs/2001.04748

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗