The word-polynomial local-solvability conjecture
Statement
Let be a finite word in the alphabet , and let be its word polynomial. A word is totally decomposable as defined by compositions of the maps , , and .
The word-polynomial local-solvability conjecture. If is not totally decomposable, then the equation
has a solution for all but finitely many primes .
This condition, together with the paper's reduction theorem, would imply the totally decomposable word conjecture. The authors do not know whether the condition is sufficient, so the problem remains open.
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.