ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnM(k)P_n^{\mathrm{M}}(k) denote the probability that a uniformly random subset S⊆[n]S\subseteq[n] has exactly kk missing differences, namely

PnM(k)=Pr⁡(2n−1−∣S−S∣=k).P_n^{\mathrm{M}}(k)=\Pr\bigl(2n-1-|S-S|=k\bigr).

Peak-at-four conjecture. For all n≥15n\ge 15 and every k≠4k\ne4,

PnM(4)>PnM(k).P_n^{\mathrm{M}}(4)>P_n^{\mathrm{M}}(k).

The paper proves that the limiting value at k=4k=4 is larger than the other values, and experimental data suggest that n=15n=15 already suffices; the conjecture supplies this explicit finite threshold.

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.