On Conjectures concerning the Labeled Coupon Collector Problem
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915579968880640 |
|---|---|
| author | Barak-Pelleg, Dina Berend, Daniel |
| author_facet | Barak-Pelleg, Dina Berend, Daniel |
| contents | We study a labeled variant of the classical Coupon Collector Problem (CCP), recently introduced by Tan et al., where coupons arrive in groups and only the set of labels is revealed. The goal is to determine the expected number of group drawings required to uniquely identify the labeling of all coupons. We focus on the case where groups consist of pairs ($k=2$), and provide rigorous proofs for two conjectures posed by Tan et al. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_23249 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On Conjectures concerning the Labeled Coupon Collector Problem Barak-Pelleg, Dina Berend, Daniel Probability Combinatorics Primary: 60C05, Secondary: 05C80, 68W20 We study a labeled variant of the classical Coupon Collector Problem (CCP), recently introduced by Tan et al., where coupons arrive in groups and only the set of labels is revealed. The goal is to determine the expected number of group drawings required to uniquely identify the labeling of all coupons. We focus on the case where groups consist of pairs ($k=2$), and provide rigorous proofs for two conjectures posed by Tan et al. |
| title | On Conjectures concerning the Labeled Coupon Collector Problem |
| topic | Probability Combinatorics Primary: 60C05, Secondary: 05C80, 68W20 |
| url | https://arxiv.org/abs/2510.23249 |