Conciseness conjecture for commutators of non-commutator words
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.