English

Boltzmann Sampling for Powersets without an Oracle

Discrete Mathematics 2026-01-27 v2 Data Structures and Algorithms Combinatorics Probability

Abstract

We show that powersets over structures with a bounded counting sequence can be sampled efficiently without evaluating the generating function. An algorithm is provided, implemented, and tested. Runtimes are comparable to existing Boltzmann samplers reported in the literature.

Cite

@article{arxiv.2601.09508,
  title  = {Boltzmann Sampling for Powersets without an Oracle},
  author = {Jean Peyen},
  journal= {arXiv preprint arXiv:2601.09508},
  year   = {2026}
}
R2 v1 2026-07-01T09:04:22.888Z