SearcharxivSearch

arXiv · 1808.05116

Probabilistic Waring problems for finite simple groups

Abstract

The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups with respect to the $L^1$ norm. Our first main result provides a positive solution to this problem. We also provide a geometric characterization of words inducing almost uniform distribution on finite simple groups of Lie type of bounded rank, and study related random walks. Our second main result concerns the probabilistic $L^{\infty}$ Waring problem for finite simple groups. We show that for every $l \ge 1$ there exists $N = N(l)$, such that if $w_1, \ldots , w_N$ are non-trivial words of length at most $l$ in pairwise disjoint sets of variables, then their product $w_1 \cdots w_N$ is almost uniform on finite simple groups with respect to the $L^{\infty}$ norm. The dependence of $N$ on $l$ is genuine. This result implies that, for every word $w = w_1 \cdots w_N$ as above, the word map induced by $w$ on a semisimple algebraic group over an arbitrary field is a flat morphism. Applications to representation varieties, subgroup growth, and random generation are also presented.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Larsen, Aner Shalev, Pham Huu Tiep. 2018-08-15. Probabilistic Waring problems for finite simple groups. https://arxiv.org/abs/1808.05116

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