83,021 research outputs found
Using TPA to count linear extensions
A linear extension of a poset is a permutation of the elements of the set
that respects the partial order. Let denote the number of linear
extensions. It is a #P complete problem to determine exactly for an
arbitrary poset, and so randomized approximation algorithms that draw randomly
from the set of linear extensions are used. In this work, the set of linear
extensions is embedded in a larger state space with a continuous parameter ?.
The introduction of a continuous parameter allows for the use of a more
efficient method for approximating called TPA. Our primary result is
that it is possible to sample from this continuous embedding in time that as
fast or faster than the best known methods for sampling uniformly from linear
extensions. For a poset containing elements, this means we can approximate
to within a factor of with probability at least using an expected number of random bits and comparisons in the poset
which is at most Comment: 12 pages, 4 algorithm
Antimatroids and Balanced Pairs
We generalize the 1/3-2/3 conjecture from partially ordered sets to
antimatroids: we conjecture that any antimatroid has a pair of elements x,y
such that x has probability between 1/3 and 2/3 of appearing earlier than y in
a uniformly random basic word of the antimatroid. We prove the conjecture for
antimatroids of convex dimension two (the antimatroid-theoretic analogue of
partial orders of width two), for antimatroids of height two, for antimatroids
with an independent element, and for the perfect elimination antimatroids and
node search antimatroids of several classes of graphs. A computer search shows
that the conjecture is true for all antimatroids with at most six elements.Comment: 16 pages, 5 figure
- …