SearcharxivSearch

arXiv · 1802.09289

Word images in symmetric and classical groups of Lie type are dense

Abstract

Let $w\in\mathbf F_k$ be a non-trivial word and denote by $w(G)\subseteq G$ the image of the associated word map $w\colon G^k\to G$. Let $G$ be one of the finite groups ${\rm S}_n,{\rm GL}_n(q),{\rm Sp}_{2m}(q),{\rm GO}_{2m}^\pm(q),{\rm GO}_{2m+1}(q),{\rm GU}_n(q)$ ($q$ a prime power, $n\geq 2$, $m\geq 1$), or the unitary group ${\rm U}_n$ over $\mathbb C$. Let $d_G$ be the normalized Hamming distance resp. the normalized rank metric on $G$ when $G$ is a symmetric group resp. one of the other classical groups and write $n(G)$ for the permutation resp. Lie rank of $G$. For $\varepsilon>0$, we prove that there exists an integer $N(\varepsilon,w)$ such that $w(G)$ is $\varepsilon$-dense in $G$ with respect to the metric $d_G$ if $n(G)\geq N(\varepsilon,w)$. This confirms metric versions of a conjectures by Shalev and Larsen. Equivalently, we prove that any non-trivial word map is surjective on a metric ultraproduct of groups $G$ from above such that $n(G)\to\infty$ along the ultrafilter. As a consequence of our methods, we also obtain an alternative proof of the result of Hui-Larsen-Shalev that $w_1({\rm SU}_n)w_2({\rm SU}_n)={\rm SU}_n$ for non-trivial words $w_1,w_2\in\mathbf F_k$ and $n$ sufficiently large.

Explore related subjects

Keep this discovery

BibTeXRIS

Jakob Schneider, Andreas Thom. 2018-02-26. Word images in symmetric and classical groups of Lie type are dense. https://doi.org/10.2140/pjm.2021.311.475

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