Coupons collecting with or without replacement, and with multipurpose coupons

Abstract

The classic Coupon-Collector Problem (CCP) is generalized to the extent that each coupons serves certain "purposes". Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all $k$-element transversals of a set system.

References in corpus (1)

• Computing the output distribution and selection probabilities of a stack filter from the DNF of its positive Boolean function

Cited by in corpus (1)

• Counting or producing all fixed cardinality transversals