Counting linear extensions of restricted posets
read the original abstract
The classical 1991 result by Brightwell and Winkler states that the number of linear extensions of a poset is #P-complete. We extend this result to posets with certain restrictions. First, we prove that the number of linear extension for posets of height two is #P-complete. Furthermore, we prove that this holds for incidence posets of graphs. Finally, we prove that the number of linear extensions for posets of dimension two is #P-complete.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Ordinal pattern probabilities for symmetric random walks
Ordinal pattern probabilities for symmetric random walks equal combinatorial counts in affine Weyl groups for uniform steps and level-function products for Laplace steps.
-
The Combinatorics of Barrier Synchronization
A systematic decomposition produces symbolic integral formulas for counting barrier-synchronized process executions, enabling generic and specialized uniform random sampling algorithms on control graphs.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.