ProbXiv
Explorersign in
Problem archiveProblem record

Statement

There are NN coupon types, with draws made independently according to a probability vector p=(p1,…,pN)\mathbf{p}=(p_1,\ldots,p_N) in the open simplex

PN={p∈RN:pk>0, ∑k=1Npk=1},\mathcal{P}_N=\{\mathbf{p}\in\mathbb{R}^N:p_k>0,\ \sum_{k=1}^N p_k=1\},

and let TNT_N be the first time every type has appeared. For an integer j≥2j\geq 2, define

UjN=#{k∈{1,…,N}:type k is drawn fewer than j times by TN}.U_j^N=\#\{k\in\{1,\ldots,N\}:\text{type }k\text{ is drawn fewer than }j\text{ times by }T_N\}.

Let u=(1/N,…,1/N)\mathbf{u}=(1/N,\ldots,1/N) be the uniform probability vector. Equal-probability conjecture. For every N≥2N\geq 2 and every integer j≥2j\geq 2, the map p↦E[UjN]\mathbf{p}\mapsto\mathbb{E}[U_j^N] on PN\mathcal{P}_N attains its maximum at the uniform vector u\mathbf{u}, and only there. This asserts that equal coupon probabilities uniquely maximize the expected deficit in the siblings model; the surrounding discussion describes the equiprobable distribution as extremal, while the conjecture remains unresolved in the supplied source.

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.