Simplicity conjecture for the characteristic polynomial of a randomized subtraction game
Statement
Let be the number of allowed moves, and let be the corresponding positive integers, with characteristic polynomial
Simplicity conjecture. The roots of are all simple whenever and for all .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.