Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Generating uniform linear extensions using few random bits (2506.14725v1)

Published 17 Jun 2025 in cs.CC, math.PR, and stat.CO

Abstract: A \emph{linear extension} of a partial order (\preceq) over items (A = { 1, 2, \ldots, n }) is a permutation (\sigma) such that for all (i < j) in (A), it holds that (\neg(\sigma(j) \preceq \sigma(i))). Consider the problem of generating uniformly from the set of linear extensions of a partial order. The best method currently known uses (O(n3 \ln(n))) operations and (O(n3 \ln(n)2)) iid fair random bits to generate such a permutation. This paper presents a method that generates a uniform linear extension using only (2.75 n3 \ln(n)) operations and ( 1.83 n3 \ln(n) ) iid fair bits on average.

Summary

We haven't generated a summary for this paper yet.