Conjecture on arbitrarily oscillating win-probability derivatives
Statement
Let denote the probability that the binary word occurs before the binary word in an iid Bernoulli sequence.
Oscillation conjecture. There exists a constant such that, for every positive integer , there is a pair of binary words with lengths at most for which
changes sign at least times as ranges over .
Win probabilities are rational functions of , with endpoint values constrained to . The conjecture predicts that despite this algebraic structure, derivatives of win-probability functions can exhibit arbitrarily many sign changes using pairs whose word lengths grow only exponentially in the number of changes. The source presents this as supported by heuristic arguments and computer checks, with no resolution given.
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.