Papers
Topics
Authors
Recent
Search
2000 character limit reached

On words that are concise in residually finite groups

Published 3 Dec 2012 in math.GR | (1212.0581v1)

Abstract: A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of w-values is finite for a group $G\in X$, it always follows that w(G) is finite. P. Hall asked whether every word is concise. Due to Ivanov the answer to this problem is known to be negative. Dan Segal asked whether every word is concise in the class of residually finite groups. In this direction we prove that if w is a multilinear commutator and q is a prime-power, then the word $wq$ is indeed concise in the class of residually finite groups. Further, we show that in the case where $w=\gamma_{k}$ the word $wq$ is boundedly concise in the class of residually finite groups. It remains unknown whether the word $wq$ is actually concise in the class of all groups.

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.