Module XVI — Combinatorial Search & Candidate Generation

Status: outline. Lecture body not authored.

Pairs: C(N, 2). Baskets of cardinality k: C(N, k). Example: C(100, 5) = 75,287,520.

Universe → Screening → Candidate Groups → Multivariate Estimation → Basket Extraction

Clustering, economic grouping, sparse screening, dimensionality reduction, statistical filters.

Unique process — Clustering ≠ cointegration

Discovery is high-dimensional search plus statistical selection, not a pair loop.