English

Strong conciseness in profinite groups

Group Theory 2020-05-27 v2

Abstract

A group word ww is said to be strongly concise in a class C\mathcal{C} of profinite groups if, for every group GG in C\mathcal{C} such that ww takes less than 202^{\aleph_0} values in GG, the verbal subgroup w(G)w(G) is finite. Detomi, Morigi and Shumyatsky established that multilinear commutator words -- and the particular words x2x^2 and [x2,y][x^2,y] -- have the property that the corresponding verbal subgroup is finite in a profinite group GG whenever the word takes at most countably many values in GG. 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 ww is one of the group words x2x^2, x3x^3, x6x^6, [x3,y][x^3,y] or [x,y,y][x,y,y], then ww 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,z1,,zr][x^m,z_1,\ldots,z_r] and [x,y,y,z1,,zr][x,y,y,z_1,\ldots,z_r], where m{2,3}m \in \{2,3\} and r1r \ge 1.

Keywords

Cite

@article{arxiv.1907.01344,
  title  = {Strong conciseness in profinite groups},
  author = {Eloisa Detomi and Benjamin Klopsch and Pavel Shumyatsky},
  journal= {arXiv preprint arXiv:1907.01344},
  year   = {2020}
}

Comments

19 pages, several minor corrections and some simplifications

R2 v1 2026-06-23T10:09:54.269Z