Non-holonomicity conjecture for the two-player winning probability
Statement
Let , and let be the probability generating function for the two-player pile game with boundary, with the initial pile size. Define the first player's winning probability by
A sequence is holonomic if it satisfies a linear recurrence with polynomial coefficients. Non-holonomicity conjecture. The winning probability sequence is not holonomic: there are no specific and polynomials such that
The conjecture concerns the apparent absence of a linear recurrence for the two-player winning probabilities, in contrast with related pile games where the corresponding sequence is holonomic of small order. The evidence presented is computational and the conjecture 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.