Conciseness conjecture for commutators of non-commutator words

Let w=w(x1,,xk)w=w(x_1,\dots,x_k) be a group-word, and let GwG_w denote the set of all values of ww in a group GG. The verbal subgroup w(G)w(G) is the subgroup generated by GwG_w, and ww is concise if w(G)w(G) is finite whenever GwG_w is finite. Let u1,,usu_1,\dots,u_s be non-commutator words, with the variables in the different words disjoint as assumed for commutator words in the paper. Conciseness conjecture. The word

[u1,,us][u_1,\dots,u_s]

is concise whenever the words u1,,usu_1,\dots,u_s are non-commutator. This conjecture is a refinement of P. Hall's disproved conjecture that every word is concise; it is motivated by known conciseness results for non-commutator words, multilinear commutator words, Engel words in small weights, and commutators of two non-commutator words. The source presents this as a natural conjecture, and no resolution of this specific statement is given.

Sources & referencesView supporting material

Primary source

João Azevedo and Pavel Shumyatsky, “On finiteness of verbal subgroups”, arXiv:2009.10121 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.