Equal-probability conjecture for the expected sibling deficit
Statement
There are coupon types, with draws made independently according to a probability vector in the open simplex
and let be the first time every type has appeared. For an integer , define
Let be the uniform probability vector. Equal-probability conjecture. For every and every integer , the map on attains its maximum at the uniform vector , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.