Papers
Topics
Authors
Recent
Search
2000 character limit reached

Strong conciseness of Engel words in profinite groups

Published 25 Aug 2021 in math.GR | (2108.11789v1)

Abstract: A group word $w$ is said to be strongly concise in a class $\mathscr C$ of profinite groups if, for any group $G$ in $\mathscr C$, either $w$ takes at least continuum values in $G$ or the verbal subgroup $w(G)$ is finite. It is conjectured that all words are strongly concise in the class of all profinite groups. Earlier Detomi, Klopsch, and Shumyatsky proved this conjecture for multilinear commutator words, as well as for some other particular words. They also proved that every group word is strongly concise in the class of nilpotent profinite groups. In the present paper we prove that for any $n$ the $n$-Engel word $[...[x,y],y],\dots y]$ (where $y$ is repeated $n$ times) is strongly concise in the class of finitely generated profinite 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.

Authors (2)

Collections

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