dorsal/arxiv
View SchemaBoltzmann Sampling for Powersets without an Oracle
| Authors | Jean Peyen |
|---|---|
| Categories | |
| ArXiv ID | 2601.09508vv2 |
| URL | https://arxiv.org/abs/2601.09508 |
| License | http://creativecommons.org/licenses/by/4.0/ |
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.
{
"annotation_id": "b30ba09b-9c78-45d5-b949-60f82299a784",
"date_created": "2026-02-17T05:53:20.502000Z",
"date_modified": "2026-02-17T05:53:20.502000Z",
"file_hash": "907990486c7b5d464dc050da8daa22cc5804313f4401348a463c1472b20353f7",
"private": false,
"record": {
"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.",
"arxiv_id": "2601.09508",
"authors": [
"Jean Peyen"
],
"categories": [
"cs.DM",
"cs.DS",
"math.CO",
"math.PR"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Boltzmann Sampling for Powersets without an Oracle",
"url": "https://arxiv.org/abs/2601.09508",
"version": "v2"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "426a5943-51c1-4c0a-aa01-f59d1fd7f11b",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}