ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let \normalfontWin⁡(v,w;p){\normalfont{\operatorname{Win}}}(v,w;p) denote the probability that the binary word vv occurs before the binary word ww in an iid Bernoulli(p)(p) sequence.

Oscillation conjecture. There exists a constant C>0C>0 such that, for every positive integer kk, there is a pair of binary words (v,w)(v,w) with lengths at most exp⁡(Ck)\exp(Ck) for which

ddp\normalfontWin⁡(v,w;p)\frac{d}{dp}{\normalfont{\operatorname{Win}}}(v,w;p)

changes sign at least kk times as pp ranges over (0,1)(0,1).

Win probabilities are rational functions of pp, with endpoint values constrained to {0,12,1}\{0,\frac12,1\}. 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 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.