Double Dixie Cup Problem Analysis

• The Double Dixie Cup Problem is a generalization of the coupon collector problem where one collects m complete sets of N coupons, accounting for extra multiplicity requirements.
• It utilizes advanced techniques including Poissonization, point‐process limits, and asymptotic methods to derive expectations, variances, and limit laws for both equal and unequal probability models.
• Recent work highlights variance extremality and shows that uniform coupon probabilities minimize variance, while rare coupon dynamics dominate completion times in heterogeneous settings.

Searching arXiv for relevant papers on the Double Dixie Cup Problem and closely related coupon-collector generalizations. The Double Dixie Cup Problem is the classical extension of the coupon collector problem in which the objective is not merely to see every coupon type once, but to obtain $m$ complete sets of all $N$ coupon types. In the standard notation of the literature, $T_m(N)$ denotes the number of trials needed until each of the $N$ coupon types has been observed at least $m$ times. The terminology “double Dixie cup” is often used for the case $m=2$, while many modern treatments use the same name for the full $m$-set problem (Doumas et al., 2014). The topic occupies a central position in probabilistic combinatorics, asymptotic analysis, and Poissonization-based methods, and has recently been developed at several levels: classical equal-probability asymptotics, unequal-probability generalizations, point-process limits, stopped occupancy formulations, and finite-$N$ extremality results for the variance (Ilienko, 2019, Doumas et al., 2014, Long, 28 Apr 2026).

1. Classical definition and basic probabilistic structure

In the standard coupon collector setup, there are $N$ coupon types, and on each trial coupon type $j\in\{1,\dots,N\}$ is drawn independently with probability $N$0, with $N$1. The ordinary coupon collector time is $N$2, the number of trials needed to see every type at least once. The Double Dixie Cup Problem generalizes this to

$N$3

so that $N$4 is the time to see every coupon twice, and more generally $N$5 is the time to complete $N$6 full sets (Doumas et al., 2014).

A closely related formulation appears in the equal-probability setting with $N$7 coupon types, where one tracks, for each type $N$8, the time $N$9 when the $T_m(N)$0-th coupon of type $T_m(N)$1 arrives. For fixed $T_m(N)$2,

$T_m(N)$3

These variables are identically distributed but not independent, because all coupon types are observed in the same stream of arrivals (Ilienko, 2019).

The equal-probability case corresponds to $T_m(N)$4. In that regime, the classical asymptotic scale for completion of $T_m(N)$5 full sets is

$T_m(N)$6

which reduces to $T_m(N)$7 for the ordinary collector problem $T_m(N)$8 (Doumas et al., 2014). In the notation of (Ilienko, 2019), the analogous centering function for the $T_m(N)$9-th arrival level is

$N$0

This shared centering already indicates the structural relation between the coupon collector problem and the Dixie cup problem: the latter introduces the extra correction $N$1, reflecting the higher arrival multiplicity threshold (Ilienko, 2019).

2. Classical equal-probability asymptotics

For fixed $N$2, Newman and Shepp proved that

$N$3

with a constant $N$4. Erdős and Rényi later identified

$N$5

where $N$6 is the Euler–Mascheroni constant, and established the limit law

$N$7

Equivalently, after shifting by $N$8, the limit is the standard Gumbel law (Doumas et al., 2014).

The same limit theorem is recovered in the point-process treatment of $N$9-th arrivals. If $m$0 denotes the equal-probability completion time, then

$m$1

where $m$2; for $m$3 this becomes

$m$4

the familiar Gumbel-type limit (Ilienko, 2019).

Recent work has also clarified the variance asymptotics in the equal-probability case. For fixed $m$5, (Long, 28 Apr 2026) proves

$m$6

and

$m$7

This recovers the classical $m$8 case and proves the fixed-$m$9 variance asymptotic for every $m=2$0, which Doumas and Papanicolaou had stated as a conjecture (Long, 28 Apr 2026).

A further extension concerns growing multiplicity $m=2$1. Defining $m=2$2 by

$m=2$3

with

$m=2$4

the paper proves the equal-probability Gumbel law

$m=2$5

where $m=2$6 is standard Gumbel, together with

$m=2$7

(Long, 28 Apr 2026).

3. Poissonization, Erlang representations, and moment formulas

A major tool throughout the subject is Poissonization, which replaces the dependent discrete-time coupon stream by independent continuous-time Poisson processes. In the equal-probability framework of (Ilienko, 2019), coupons arrive at times of a unit-rate Poisson process with i.i.d. uniform marks in $m=2$8. For each coupon type $m=2$9, the arrivals of that type form an independent rate-$m$0 Poisson process, and the $m$1-th arrival time $m$2 satisfies

$m$3

The discrete and poissonized times are coupled by

$m$4

In the unequal-probability setting, (Doumas et al., 2014) introduces independent Poisson processes $m$5 with rates $m$6, and lets $m$7 be the time of the $m$8-th event in process $m$9. Then $N$0 is Erlang with survival function

$N$1

Since the $N$2’s are independent,

$N$3

where $N$4 (Doumas et al., 2014).

This Poissonized structure yields explicit integral formulas for moments. The $N$5-th rising moment is

$N$6

and in particular

$N$7

$N$8

Hence

$N$9

(Doumas et al., 2014).

The same Poissonized representation underlies the finite-$N$0 theory in (Long, 28 Apr 2026). There, coupon $N$1 is assigned an independent Poisson process of rate $N$2, and the continuous completion time $N$3 is the time at which every process has reached level $N$4. Since the waiting time to the $N$5-th arrival is Gamma/Erlang,

$N$6

is the survival function of the Erlang$N$7 time, and

$N$8

The paper also uses the exact transfer identity

$N$9

so that the Poissonized model controls the discrete completion time through rising moments (Long, 28 Apr 2026).

4. Point-process and functional-limit formulations

A major conceptual shift occurs in the point-process approach of (Ilienko, 2019). Instead of analyzing only the scalar completion time $j\in\{1,\dots,N\}$0, the paper studies the full family of centered and normalized $j\in\{1,\dots,N\}$1-th arrival times,

$j\in\{1,\dots,N\}$2

Its poissonized analogue is

$j\in\{1,\dots,N\}$3

The main theorem states that if $j\in\{1,\dots,N\}$4 is the Poisson point process on $j\in\{1,\dots,N\}$5 with intensity measure

$j\in\{1,\dots,N\}$6

then

$j\in\{1,\dots,N\}$7

Thus the centered and normalized $j\in\{1,\dots,N\}$8-th arrival times across coupon types converge to a non-homogeneous Poisson point process with exponential intensity $j\in\{1,\dots,N\}$9 (Ilienko, 2019).

The limit process admits a useful representation. If $N$00 is a unit-rate Poisson point process on $N$01, and

$N$02

then

$N$03

This identifies $N$04 as the image of a homogeneous Poisson process under a logarithmic transformation (Ilienko, 2019).

The point-process limit is stronger than the classical one-dimensional limit and yields infinite-dimensional extensions. Let $N$05 be the first time when some $N$06 coupon types have already appeared at least $N$07 times each, and define

$N$08

Then

$N$09

and Theorem 4.1 gives

$N$10

This is an infinite-dimensional extension of classical limit theorems for the Dixie cup problem (Ilienko, 2019).

The same framework yields a functional limit for rare coupon types. A type $N$11 is called $N$12-rare if

$N$13

Let

$N$14

Then $N$15 converges in $N$16 with the $N$17-topology to

$N$18

where $N$19 is a standard unit-rate Poisson process (Ilienko, 2019).

This process-level formulation suggests that the Double Dixie Cup Problem is naturally interpreted not only as a first-passage problem for a maximum, but also as an extremal point-process problem for the entire cloud of multiplicity-threshold arrival times.

5. Unequal probabilities and heterogeneous coupon populations

A substantial generalization replaces equal sampling probabilities by a positive sequence

$N$20

and defines

$N$21

The Double Dixie Cup Problem then becomes the analysis of $N$22 under arbitrary positive coupon probability vectors generated by $N$23 (Doumas et al., 2014).

A key dichotomy in (Doumas et al., 2014) is whether there exists $N$24 such that

$N$25

This leads to two regimes.

Regime	Condition	Limiting behavior
Case I	$N$26	Nonuniversal limit depending on $N$27
Case II	$N$28 with $N$29	Gumbel regime after adapted normalization

In Case I, the paper defines

$N$30

and

$N$31

Then

$N$32

If $N$33, the asymptotics are

$N$34

$N$35

and

$N$36

The corresponding limit law is

$N$37

where

$N$38

This limit is not universal and is generally not Gumbel (Doumas et al., 2014).

In Case II, one writes

$N$39

with $N$40 positive, increasing, smooth, and satisfying

$N$41

together with additional regularity assumptions. Defining

$N$42

the paper proves

$N$43

and

$N$44

Most notably, in Case II the leading variance term is independent of $N$45 (Doumas et al., 2014).

The limit law in this regime is Gumbel after adapted centering and scaling. With

$N$46

where

$N$47

one has

$N$48

This extends the Erdős–Rényi limit from equal probabilities to broad classes of unequal probabilities (Doumas et al., 2014).

Examples explicitly treated include generalized Zipf laws $N$49, exponential weights $N$50, and slow logarithmic decay $N$51 (Doumas et al., 2014).

6. Interlacing mixtures, stopped occupancy, and maximal counts

The heterogeneous setting is developed further in (Doumas, 29 Oct 2025), which studies an interlacing mixture of two coupon distributions. There, one considers

$N$52

with $N$53, so the coupon population consists of two subfamilies, each of size $N$54: a common family $N$55 and a rare family $N$56. Their masses are

$N$57

The paper assumes $N$58 and

$N$59

with $N$60 positive, increasing, $N$61, and satisfying the stated derivative conditions (Doumas, 29 Oct 2025).

The central random variable remains

$N$62

the number of trials needed until each of the $N$63 coupon types has been observed at least $N$64 times. The standard integral representation is

$N$65

Using Poissonization, the process is decomposed into rare-coupon stages. If $N$66 is the number of common-family arrivals between successive rare-family arrivals, then

$N$67

and

$N$68

By Wald’s lemma,

$N$69

Hence

$N$70

This identifies a product structure: a mass factor $N$71 depending on both subfamilies, and a hardness factor determined only by the rare subfamily (Doumas, 29 Oct 2025).

For the rare family,

$N$72

so that

$N$73

up to the specific asymptotics of $N$74. The paper emphasizes that the parameter $N$75 does not appear in the leading term as $N$76 (Doumas, 29 Oct 2025). This suggests that, in this heterogeneous regime, the rarest coupons dominate the asymptotic difficulty regardless of the requested multiplicity.

A different but related reformulation appears in the stopped occupancy model of (Gnedin et al., 25 Jun 2025). Balls are thrown independently into $N$77 boxes, each with probability $N$78, and the process stops when only $N$79 boxes remain that have at most $N$80 balls: $N$81 Equivalently,

$N$82

This includes the coupon collector problem as $N$83, and the Dixie cup problem as $N$84 (Gnedin et al., 25 Jun 2025).

The paper studies not primarily the stopping time but the maximum occupancy at that time,

$N$85

With

$N$86

one has

$N$87

where $N$88 has a Gumbel law of order $N$89. For the maximum, however, there is no single limit distribution. Defining

$N$90

with $N$91, $N$92, the paper proves

$N$93

where $N$94 is standard Gumbel and $N$95 is independent (Gnedin et al., 25 Jun 2025).

For the Double Dixie Cup setting, this means the maximal occupancy at completion is asymptotically a rounded sum of two independent Gumbels, with oscillations close to periodic on a logarithmic scale. The nonconvergence of $N$96 as $N$97 is attributed to the fractional centering term $N$98, so that convergence occurs only along subsequences with $N$99 (Gnedin et al., 25 Jun 2025).

7. Variance extremality, terminal defects, and broader uses

A recent finite-$T_m(N)$00 development is the variance extremality theory of (Long, 28 Apr 2026). For every $T_m(N)$01 and $T_m(N)$02, among all positive coupon probability vectors

$T_m(N)$03

the variance of the time $T_m(N)$04 to collect $T_m(N)$05 complete sets is uniquely minimized at the uniform vector

$T_m(N)$06

More precisely,

$T_m(N)$07

with equality iff $T_m(N)$08 (Long, 28 Apr 2026).

The paper proves the stronger radial monotonicity statement: if

$T_m(N)$09

then $T_m(N)$10 is strictly increasing for $T_m(N)$11. The proof is based on a terminal-defect viewpoint. At time $T_m(N)$12, coupon $T_m(N)$13 is still defective if it has been seen fewer than $T_m(N)$14 times, with defect probability $T_m(N)$15, and the expected number of terminal defects is

$T_m(N)$16

Completion occurs exactly when this count is zero (Long, 28 Apr 2026).

The analytic core of the argument is a monotone-likelihood-ratio comparison derived from a log-scale monotonicity property of the Gamma reverse hazard. If

$T_m(N)$17

then

$T_m(N)$18

is strictly negative and strictly decreasing on $T_m(N)$19. Consequently $T_m(N)$20 is strictly decreasing, and for every $T_m(N)$21, the ratio

$T_m(N)$22

is strictly decreasing (Long, 28 Apr 2026). This is the one-site input supporting the global variance comparison.

The Double Dixie Cup Problem also appears outside its original probabilistic context. In query-based $T_m(N)$23-means clustering with same-cluster queries, (Chien et al., 2018) uses it as the combinatorial model for the number of random samples required until every cluster has enough representatives to estimate its centroid. The paper explicitly states: “The double Dixie cup problem is an extension of the classical coupon collector problem in which the collector is required to collect $T_m(N)$24 sets of coupons.” In that setting, coupon types correspond to clusters, and obtaining $T_m(N)$25 samples from every cluster is the analogue of completing $T_m(N)$26 sets (Chien et al., 2018).

Let $T_m(N)$27 be the number of sampling rounds needed until each of the $T_m(N)$28 cluster-types has been seen at least $T_m(N)$29 times. The paper states

$T_m(N)$30

where

$T_m(N)$31

Under an $T_m(N)$32-imbalance assumption, it derives the bound

$T_m(N)$33

which feeds directly into the query complexity

$T_m(N)$34

for the noiseless clustering algorithm (Chien et al., 2018). This application shows that the Double Dixie Cup Problem functions as a reusable probabilistic template whenever “coverage with multiplicity” is the governing bottleneck.

Taken together, these developments show that the Double Dixie Cup Problem is no longer confined to the classical question of expectation asymptotics for equal probabilities. It now comprises a family of models and techniques: exact Poissonized representations, non-homogeneous Poisson point-process limits, asymptotics for unequal and interlaced probability profiles, stopped occupancy extremal statistics, and finite-$T_m(N)$35 extremality principles (Doumas et al., 2014, Ilienko, 2019, Doumas, 29 Oct 2025, Gnedin et al., 25 Jun 2025, Long, 28 Apr 2026). A plausible implication is that the modern theory views completion not merely as a hitting time, but as an extreme-value and defect-elimination phenomenon whose asymptotic form depends sensitively on the rarity structure of the coupon population.