On finiteness of verbal subgroups
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:HVCOWQQErecord.jsonopen to challenge →
classification
math.GR
keywords
concisedotsfiniteverbalwordconjecturedenotedfiniteness
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.