SearcharxivSearch

arXiv · 2308.02209

Varieties of groups and the problem on conciseness of words

Abstract

A group-word $w$ is concise in a class of groups $\mathcal X$ if and only if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G\in \mathcal X$. It is a long-standing open problem whether every word is concise in residually finite groups. In this paper we observe that the conciseness of a word $w$ in residually finite groups is equivalent to that in the class of virtually pro-$p$ groups. This is used to show that if $q,n$ are positive integers and $w$ is a multilinear commutator word, then the words $w^q$ and $[w^q,_{n} y]$ are concise in residually finite groups. Earlier this was known only in the case where $q$ is a prime power. In the course of the proof we establish that certain classes of groups satisfying the law $w^q\equiv1$, or $[\delta_k^q,{}_n\, y]\equiv1$, are varieties.

Explore related subjects

Keep this discovery

BibTeXRIS

Cristina Acciarri, Pavel Shumyatsky. 2023-08-04. Varieties of groups and the problem on conciseness of words. https://arxiv.org/abs/2308.02209

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