Papers
Topics
Authors
Recent
Search
2000 character limit reached

Varieties of groups and the problem on conciseness of words

Published 4 Aug 2023 in math.GR | (2308.02209v2)

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 $wq$ and $[wq,_{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 $wq\equiv1$, or $[\delta_kq,{}_n\, y]\equiv1$, are varieties.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.