Monotonicity conjecture for favorable longer-word pairs
Statement
Let be a sufficiently large positive integer. For binary words of length at most , let and be their first occurrence times in an iid Bernoulli sequence, and let be longer than .
Monotonicity conjecture. The number of pairs satisfying
is non-increasing as a function of .
This conjecture formalizes the expected increase, as the Bernoulli parameter decreases, in the frequency with which a longer word defeats a shorter word. It is supported by computer computations but is disproved by the example , whose win probability is and is minimized at , so the asserted monotonicity fails.
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.