Conciseness conjecture for commutators of non-commutator words
Conciseness conjecture for commutators of non-commutator words
Let be a group-word, and let denote the set of all values of in a group . The verbal subgroup is the subgroup generated by , and is concise if is finite whenever is finite. Let be non-commutator words, with the variables in the different words disjoint as assumed for commutator words in the paper. Conciseness conjecture. The word
is concise whenever the words 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.