Papers
Topics
Authors
Recent
Search
2000 character limit reached

On finiteness of verbal subgroups

Published 21 Sep 2020 in math.GR | (2009.10121v2)

Abstract: Given a group-word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. The word $w$ is concise if $w(G)$ is finite for all groups $G$ in which $G_w$ is finite. We obtain several results supporting the conjecture that the word $[u_1,\dots,u_s]$ is concise whenever the words $u_1,\dots,u_s$ are non-commutator.

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.