Papers
Topics
Authors
Recent
Search
2000 character limit reached

Strong conciseness in profinite groups

Published 2 Jul 2019 in math.GR | (1907.01344v2)

Abstract: A group word $w$ is said to be strongly concise in a class $\mathcal{C}$ of profinite groups if, for every group $G$ in $\mathcal{C}$ such that $w$ takes less than $2{\aleph_0}$ values in $G$, the verbal subgroup $w(G)$ is finite. Detomi, Morigi and Shumyatsky established that multilinear commutator words -- and the particular words $x2$ and $[x2,y]$ -- have the property that the corresponding verbal subgroup is finite in a profinite group $G$ whenever the word takes at most countably many values in $G$. They conjectured that, in fact, this should be true for every word. In particular, their conjecture included as open cases power words and Engel words. In the present paper, we take a new approach via parametrised words that leads to stronger results. First we prove that multilinear commutator words are strongly concise in the class of all profinite groups. Then we establish that every group word is strongly concise in the class of nilpotent profinite groups. From this we deduce, for instance, that, if $w$ is one of the group words $x2$, $x3$, $x6$, $[x3,y]$ or $[x,y,y]$, then $w$ is strongly concise in the class of all profinite groups. Indeed, the same conclusion can be reached for all words of the infinite families $[xm,z_1,\ldots,z_r]$ and $[x,y,y,z_1,\ldots,z_r]$, where $m \in {2,3}$ and $r \ge 1$.

Summary

Paper to Video (Beta)

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.