ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ww be a finite word in the alphabet {X,A}\{X,A\}, and let Pw(x,y)∈Z[x,y]P_w(x,y)\in\mathbb Z[x,y] be its word polynomial. A word is totally decomposable as defined by compositions of the maps u↦(uAk)muu\mapsto (uA^k)^m u, u↦uAu\mapsto uA, and u↦Auu\mapsto Au.

The word-polynomial local-solvability conjecture. If ww is not totally decomposable, then the equation

Pw(x2,y2)=0P_w(x^2,y^2)=0

has a solution (xp,yp)∈(Z/pZ)∗×(Z/pZ)∗(x_p,y_p)\in(\mathbb Z/p\mathbb Z)^*\times(\mathbb Z/p\mathbb Z)^* for all but finitely many primes pp.

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 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.