Doumas–Papanicolaou's finite variance-minimization conjecture for the double Dixie cup problem
Statement
Let and be fixed, let range over the probability simplex on coupon types, and let denote the number of draws needed to collect at least copies of every type. For a probability vector , write for the variance under the corresponding coupon-collection process, and let
Finite variance extremality. The equal-probability vector minimizes
over the probability simplex. The conjecture concerns variance minimization in the nonuniform double Dixie cup problem. Its case was later proved by Yu, while the statement for general fixed 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.