Search arXivSearch

arXiv · 1107.3341

Waring Problem for Finite Quasisimple Groups

Abstract

The classical Waring problem deals with expressing every natural number as a sum of g(k) kth powers. Similar problems for finite simple groups have been studied recently, and in this paper we study them for finite quasisimple groups G. We show that for a fixed non-trivial group word w and large enough G we have w(G)^3=G, namely every element of G is a product of 3 values of w. For various families of finite quasisimple groups, including covers of alternating groups, we obtain a stronger result, namely w(G)^2=G. However, in contrast with the case of simple groups, we show that w(G)^2 need not equal G for all large G. If k>2 then x^k y^k fails to be surjective for infinitely many finite quasisimple groups. The case k=2 turns out to be exceptional. Indeed, our last result shows that every element of a finite quasisimple group is a product of two squares. This can be regarded as a non-commutative analogue of Lagrange's four squares theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Larsen, Aner Shalev, Pham Huu Tiep. 2011-07-17. Waring Problem for Finite Quasisimple Groups. https://arxiv.org/abs/1107.3341

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