The totally decomposable word conjecture
Statement
Let be a finite word in the alphabet . A word is totally decomposable if it is the image of under a composition of maps for , , together with and . A word is universal if, for every uniquely divisible group and every , the equation has a solution ; it is uniquely universal if that solution is always unique. A solution is in terms of radicals when it is obtained by the radical operations defined for the free uniquely divisible group in the paper.
The totally decomposable word conjecture. The following are equivalent: is totally decomposable; is uniquely universal; is universal; and has a solution in terms of radicals.
The implications from total decomposability to unique universality and from unique universality to universality, as well as the equivalence with radical solvability, are straightforward. The difficult implication is that radical solvability forces total decomposability; the authors verified the conjecture computationally for words of length at most .
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.