SearcharxivSearch

arXiv · 1108.0547

Positive laws on generators in powerful pro-p groups

Abstract

If G is a finitely generated powerful pro-p group satisfying a certain law v=1, and if G can be generated by a normal subset T of finite width which satisfies a positive law, we prove that G is nilpotent. Furthermore, the nilpotency class of G can be bounded in terms of the prime p, the number of generators of G, the law v=1, the width of T, and the degree of the positive law. The main interest of this result is the application to verbal subgroups: if G is a p-adic analytic pro-p group in which all values of a word w satisfy positive law, and if the verbal subgroup w(G) is powerful, then w(G) is nilpotent.

Explore related subjects

Keep this discovery

BibTeXRIS

Cristina Acciarri, Gustavo A. Fernández-Alcober. 2011-08-02. Positive laws on generators in powerful pro-p groups. https://arxiv.org/abs/1108.0547

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