ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ww be a finite word in the alphabet {X,A}\{X,A\}. A word is totally decomposable if it is the image of XX under a composition of maps πm,k:u↦(uAk)mu\pi_{m,k}:u\mapsto (uA^k)^m u for m≥1m\geq 1, k≥0k\geq 0, together with r:u↦uAr:u\mapsto uA and l:u↦Aul:u\mapsto Au. A word is universal if, for every uniquely divisible group GG and every A,B∈GA,B\in G, the equation w(X,A)=Bw(X,A)=B has a solution X∈GX\in G; 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: ww is totally decomposable; ww is uniquely universal; ww is universal; and w(X,A)=Bw(X,A)=B 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 1010.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.