ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let mm and NN be fixed, let pp range over the probability simplex on NN coupon types, and let Tm(N)T_m(N) denote the number of draws needed to collect at least mm copies of every type. For a probability vector pp, write Var⁡p(Tm(N))\operatorname{Var}_p(T_m(N)) for the variance under the corresponding coupon-collection process, and let

u=(1/N,…,1/N).u=(1/N,\ldots,1/N).

Finite variance extremality. The equal-probability vector ν\nu minimizes

p↦Var⁡p(Tm(N))p\mapsto \operatorname{Var}_p(T_m(N))

over the probability simplex. The conjecture concerns variance minimization in the nonuniform double Dixie cup problem. Its m=1m=1 case was later proved by Yu, while the statement for general fixed mm 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.