Azevedo–Shumyatsky conciseness conjecture for commutators of non-commutator words
Statement
Let be non-commutator words in pairwise disjoint sets of variables. For a group word , write for the word obtained by substituting the into . A word is concise if, in every group, finiteness of its set of values implies finiteness of its verbal subgroup.
Azevedo–Shumyatsky conjecture. The word
is concise.
This conjecture generalizes known conciseness results for commutators involving non-commutator words; the paper's abstract states that it proves this generalized conjecture for lower central and derived words.
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.