SearcharxivSearch

arXiv · math/0701334

Word maps and Waring type problems

Abstract

Waring's classical problem deals with expressing every natural number as a sum of g(k) k-th powers. Recently there has been considerable interest in similar questions for nonabelian groups, and simple groups in particular. Here the k-th power word is replaced by an arbitrary nontrivial group word w, and the goal is to express group elements as short products of values of w. We give a best possible and somewhat surprising solution for this Waring type problem for various finite simple groups, showing that a product of length two suffices to express all elements. We also show that the set of values of w is very large, improving various results obtained previously. Along the way we also obtain new results of independent interest on character values and class squares in symmetric groups. Our methods involve algebraic geometry, representation theory, probabilistic arguments, as well as three prime theorems from additive number theory (approximating Goldbach's Conjecture).

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Larsen, Aner Shalev. 2007-01-11. Word maps and Waring type problems. https://arxiv.org/abs/math/0701334

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