ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a sufficiently large positive integer. For binary words v,wv,w of length at most nn, let τv\tau_v and τw\tau_w be their first occurrence times in an iid Bernoulli(p)(p) sequence, and let vv be longer than ww.

Monotonicity conjecture. The number of pairs (v,w)(v,w) satisfying

Pp(τv<τw)>12\mathbb{P}_p(\tau_v < \tau_w)>\frac{1}{2}

is non-increasing as a function of p∈(0,12)p\in\left(0,\frac{1}{2}\right).

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 (v,w)=(100010,001100)(v,w)=(100010,001100), whose win probability is 12(1−p(1−p)4)\frac{1}{2}(1-p(1-p)^4) and is minimized at p=15p=\frac{1}{5}, 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 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.