Search arXivSearch

arXiv · 1708.00477

Approximability of word maps by homomorphisms

Abstract

Generalizing a recent result of Mann, we show that there is an explicit function $f:\left(0,1\right]\rightarrow\left(0,1\right]$ such that for every reduced word $w$, say in $d$ variables, there is an explicit reduced word $v$ in at most $3d$ variables (nontrivial if the length of $w$ is at least $2$) such that for all $\rho\in\left(0,1\right]$, the following holds: If $G$ is any finite group for which the word map $w_G:G^d\rightarrow G$ agrees with some fixed homomorphism $G^d\rightarrow G$ on at least $\rho|G|^d$ many arguments, then the word map $v_G:G^{3d}\rightarrow G$ has a fiber of size at least $f(\rho)|G|^{3d}$. We also discuss some applications of this result.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Bors. 2017-08-01. Approximability of word maps by homomorphisms. https://arxiv.org/abs/1708.00477

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