ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥1n\geq 1, let c∈{1,…,n}c\in\{1,\ldots,n\}, and let p=(p1,…,pn)∈(0,1)np=(p_1,\ldots,p_n)\in(0,1)^n satisfy p1+⋯+pn≤1p_1+\cdots+p_n\leq 1. Write

p0=1−(p1+⋯+pn),v=(v1,…,vn),vi=1−p0n,u=(1n,…,1n).p_0=1-(p_1+\cdots+p_n),\qquad v=(v_1,\ldots,v_n),\quad v_i=\frac{1-p_0}{n},\qquad u=\left(\frac1n,\ldots,\frac1n\right).

Here Tc,n(p)T_{c,n}(p) denotes the time needed in the generalized coupon collector problem with coupon distribution pp. Uniform distribution conjecture. For every k≥0k\geq 0,

\mathbbmP{Tc,n(p)>k}≥\mathbbmP{Tc,n(v)>k}≥\mathbbmP{Tc,n(u)>k}.\mathbbm{P}\{T_{c,n}(p)>k\}\geq\mathbbm{P}\{T_{c,n}(v)>k\}\geq\mathbbm{P}\{T_{c,n}(u)>k\}.

Equivalently, the complementary distribution function of Tc,nT_{c,n} is minimized by the uniform distribution, with the intermediate equalization distribution vv providing the stated comparison. The paper presents this as a new conjecture; no resolution is supplied in the given text.

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.