{"id":"openai-math/Exact-Uniform-Sampling-of-Contingency-Tables-with-Arbitrary-Margins","pdf":"https://github.com/openai/math/blob/main/preprints/Exact-Uniform-Sampling-of-Contingency-Tables-with-Arbitrary-Margins-September-24-2026/main.pdf","url":"https://github.com/openai/math/tree/main/preprints/Exact-Uniform-Sampling-of-Contingency-Tables-with-Arbitrary-Margins-September-24-2026","tags":["algorithms","sampling","contingency-tables"],"score":0,"title":"Exact Uniform Sampling of Contingency Tables with Arbitrary Margins","domain":"Theoretical computer science","family":"115","origin":"ai-generated","source":"openai-math","authors":["OpenAI"],"reviews":0,"subject":"cs.CC","summary":"We give an exact uniform sampler for nonnegative integer contingency tables with arbitrary prescribed margins. It terminates almost surely and has expected bit complexity polynomial in both dimensions and the binary length of the margins. No positivity, balance, sparsity, or fixed-dimension assumption is required.","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"discussed":0,"published":"2026-09-24","reactions":{},"formalized":false,"family_title":"Sampling and counting contingency tables with arbitrary margins"}