The dixie cup problem and FKG inequality

Abstract

AbstractLet be the number of purchases required to obtain copies of given items, each purchase choosing at random one of the items. is the expected value of the random variable . The problem of obtaining a formula for is known as the dixie cup problem. The problem is easy for , but difficult for m > 1. Newman and Shepp solve the problem for all m, n. From the formula, they obtain the asymptotics of for each fixed and tending to infinity. Later, Erdös and Rényi obtain the limit law for , for each fixed and tending to infinity. From the limit law, they also derive and improve on the result of Newman and Shepp. The derivation is however incomplete, as they do not address the problem of estimating the tails of the distribution of . In this paper, we provide the estimates. The estimates depend on notions concerning conditional probabilities. In particular, we use the FKG inequality, a correlation inequality which is a fundamental tool in statistical mechanics and probabilistic combinatorics.