Counting linear extensions

Related Items (91)

Webs and posets ⋮ What is the dimension of citation space? ⋮ Counting consistent phylogenetic trees is \#P-complete ⋮ Fast perfect sampling from linear extensions ⋮ Universal and overlap cycles for posets, words, and juggling patterns ⋮ Analysis on Aggregation Function Spaces ⋮ The computational complexity of calculating partition functions of optimal medians with Hamming distance ⋮ Upper Bounds on Mixing Time of Finite Markov Chains ⋮ A comment on ``Computational complexity of stochastic programming problems ⋮ A note on observables for counting trails and paths in graphs ⋮ Finding parity difference by involutions ⋮ Badness of Serial Fit Revisited ⋮ Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations ⋮ A loop-free algorithm for generating the linear extensions of a poset ⋮ Linear extension numbers of \(n\)-element posets ⋮ Ranking the vertices of a complete multipartite paired comparison digraph ⋮ Computational complexity of a solution for directed graph cooperative games ⋮ Sequence Covering Arrays and Linear Extensions ⋮ Approximating the number of linear extensions ⋮ Two Double Poset Polytopes ⋮ The cross-product conjecture for width two posets ⋮ A Sequential Importance Sampling Algorithm for Counting Linear Extensions ⋮ Effective Poset Inequalities ⋮ Balance constants for Coxeter groups ⋮ Random threshold digraphs ⋮ Mixing time for Markov chain on linear extensions ⋮ The \(1/3-2/3\) Conjecture for Coxeter groups ⋮ Young tableaux with periodic walls: counting with the density method ⋮ Counting linear extensions of posets with determinants of hook lengths ⋮ Causal set generator and action computer ⋮ Small Complexity Gaps for Comparison-Based Sorting ⋮ Sorting probability for large Young diagrams ⋮ Contagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network Algorithms ⋮ Posets with seven linear extensions sortable by three comparisons ⋮ Evolution on distributive lattices ⋮ Signature cumulants, ordered partitions, and independence of stochastic processes ⋮ Unnamed Item ⋮ Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes ⋮ Hook inequalities ⋮ Unnamed Item ⋮ Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences ⋮ On a learning precedence graph concept for the automotive industry ⋮ Sorting under partial information (without the ellipsoid algorithm). ⋮ Counting linear extensions of restricted posets ⋮ On random generation of fuzzy measures ⋮ Mixing times of lozenge tiling and card shuffling Markov chains ⋮ Counting linear extensions ⋮ The combinatorics of tandem duplication ⋮ A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions ⋮ Asymptotics of the number of standard Young tableaux of skew shape ⋮ Combinatorial Markov chains on linear extensions ⋮ Connected order ideals and \(P\)-partitions ⋮ Extensions of partial cyclic orders, Euler numbers and multidimensional boustrophedons ⋮ Uniquely pressable graphs: characterization, enumeration, and recognition ⋮ The Shapley value for cooperative games under precedence constraints ⋮ Research problem: combinatorial and multilinear aspects of sign-balanced posets ⋮ Using TPA to count linear extensions ⋮ On the restricted cores and the bounded core of games on distributive lattices ⋮ Approximating the volume of tropical polytopes is difficult ⋮ Polytopes and Large Counterexamples ⋮ Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge ⋮ Why Is Pi Less Than Twice Phi? ⋮ Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice ⋮ Bottom-up: a new algorithm to generate random linear extensions of a poset ⋮ Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings ⋮ Rank tests from partially ordered data using importance and MCMC sampling methods ⋮ Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures ⋮ Algorithms for computing the Shapley value of cooperative games on lattices ⋮ Naruse hook formula for linear extensions of mobile posets ⋮ Volume computation for sparse Boolean quadric relaxations ⋮ How to integrate a polynomial over a simplex ⋮ On the Geometry of the Last Passage Percolation Problem ⋮ Preprocessing Ambiguous Imprecise Points ⋮ Unnamed Item ⋮ On \(P\)-partitions related to ordinal sums of posets ⋮ Reconstruction of Partial Orders and List Representation as Random Structures ⋮ Entropy conservation for comparison-based algorithms ⋮ Ehrhart polynomials of matroid polytopes and polymatroids ⋮ A new characterization of \(\mathcal{V} \)-posets ⋮ Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case ⋮ On Generalized Comparison-Based Sorting Problems ⋮ Exploiting Symmetries in Polyhedral Computations ⋮ A faster tree-decomposition based algorithm for counting linear extensions ⋮ Balanced pairs in partial orders ⋮ Faster random generation of linear extensions ⋮ Counting Linear Extensions of Posets with Determinants of Hook Lengths ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding ⋮ A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem ⋮ Order series of labelled posets ⋮ MINING POSETS FROM LINEAR ORDERS ⋮ Similarity of personal preferences: Theoretical foundations and empirical analysis

Cites Work

This page was built for publication: Counting linear extensions