Some Monotonicity Properties of Partial Orders
From MaRDI portal
Publication:3960129
Cites work
Cited in
(24)- Two time-space tradeoffs for element distinctness
- Partitions of a finite three-complete poset
- Higher dimensional restricted lattice paths with diagonal steps
- Inherent complexity trade-offs for range query problems
- The cross-product conjecture for width two posets
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
- Order-invariant measures on fixed causal sets
- Order Preserving Maps and Linear Extensions of a Finite Poset
- A structure theorem for posets admitting a ``strong chain partition: a generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities)
- A Monotonicity Property of Partial Orders
- The FKG Inequality and Some Monotonicity Properties of Partial Orders
- Extensions of the Kahn-Saks inequality for posets of width two
- On Unimodality for Linear Extensions of Partial Orders
- Average height in a partially ordered set
- Correlation Among Partial Orders
- Permutation inversions and multidimensional cumulative distribution functions
- Two combinatorial applications of the Aleksandrov-Fenchel inequalities
- A structure theory for ordered sets
- Events correlated with respect to every subposet of a fixed poset
- Some correlation inequalities in finite posets
- Linear extensions of infinite posets
- Correlation in partially ordered sets
- Algebraic methods toward higher-order probability inequalities. II.
- On the time-space tradeoff for sorting with linear queries
This page was built for publication: Some Monotonicity Properties of Partial Orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960129)