ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r⩾2r\geqslant 2 and let nn be the length of a word over a two-letter alphabet. An rr-regular word is a word satisfying the corresponding regularity condition, and PTE⁡(2r+1,2,r)\operatorname{PTE}(2^{r+1},2,r) denotes the set of words representing Prouhet–Tarry–Escott solutions with these parameters. Regular-word existence and uniqueness conjecture. On a two-letter alphabet, there are rr-regular words of length nn if and only if

n=k⋅2r,k⩾2.n=k\cdot 2^r,\qquad k\geqslant 2.

Moreover, PTE⁡(2r+1,2,r)\operatorname{PTE}(2^{r+1},2,r) contains just one word: the initial segment of the Thue–Morse sequence of length 2r+12^{r+1}. The preceding theorem establishes existence whenever n=k⋅2rn=k\cdot 2^r with k⩾2k\geqslant 2; the conjectural content is the converse for all r⩾2r\geqslant 2 and the asserted uniqueness of the corresponding Prouhet–Tarry–Escott word.

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.