Reproduce “Generating uniform linear extensions using few random bits” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Mark Huber

The authors present an exact uniform sampler for linear extensions, complete orderings respecting a partial order. It replaces randomly selected adjacent positions with a fixed left-to-right sweep and tracks uncertainty with a bounding chain. For n items, the theorem bounds expected operations by 2.75 n³ ln(n) and fair bits by 1.83 n³ ln(n), theoretical bounds rather than timing results.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.