ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let tt be the number of allowed moves, and let d1,…,dtd_1,\ldots,d_t be the corresponding positive integers, with characteristic polynomial

χS(x)=txdt+∑i=1t−1xdi+1.\chi_S(x)=tx^{d_t}+\sum_{i=1}^{t-1}x^{d_i}+1.

Simplicity conjecture. The roots of χS(x)\chi_S(x) are all simple whenever dt≡1(mod2)d_t\equiv 1\pmod{2} and di≡0(mod2)d_i\equiv 0\pmod{2} for all 1≤i≤t−11\leq i\leq t-1.

This conjecture concerns the case not covered by the preceding convergence theorem and would permit the authors' argument to proceed under the assumption that all roots are simple. The source gives no proof or resolution of the claim.

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.