ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be chosen uniformly at random from [n]={0,1,…,n−1}[n]=\{0,1,\dots,n-1\}. Write

PnH(k)=Pr⁡(∣S−S∣=k)P_n^{\mathrm{H}}(k)=\Pr\bigl(|S-S|=k\bigr)

for the probability that the diffset has size kk, and call kk a divot when its probability is lower than the neighboring values in the distribution. For k≪nk\ll n, the typical diffset size is k(k−1)+1k(k-1)+1.

Divot classification conjecture. For every k>1k>1, k(k−1)+3k(k-1)+3 is a divot of PnHP_n^{\mathrm{H}} for sufficiently large nn. Furthermore, these are the only divots.

The conjecture predicts the complete pattern of divots in the distribution of diffset sizes when the selected-set size is small relative to nn. The source gives no resolution status.

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.