Proportional transitivity in linear extensions of ordered sets
Let \(p_{ij}\) denote the proportion of all linear extensions \(>*\) of a partial order on \(\{\) 1,2,3,...,n\(\}\) in which \(i>*j\). The deterministic transitivity law for the subset \(\{\) 1,2,3\(\}\) says that \((p_{12}=1,p_{23}=1)\Rightarrow p_{13}=1\), and similarly for permutations of 123. The corresponding probabilistic or proportional transitivity law asserts that, for all (\(\lambda\),\(\mu)\) in the unit square, \((p_{12}\geq \lambda,p_{23}\geq \mu)\Rightarrow p_{13}\geq f(\lambda,\mu)\), where f(\(\lambda\),\(\mu)\) is the infimum of \(p_{13}\) over all finite posets that have \(p_{12}\geq \lambda\) and \(p_{23}\geq \mu.\) It is shown that \(f(\lambda,\mu)=0\) when \(\lambda +\mu <1\), and \(f(1,\mu)=\mu\). Moreover, f(\(\lambda\),1-\(\lambda)\leq 1/e\), and, when \(\lambda +\mu >1\) and \(\max \{\lambda,\mu \}<1\), f(\(\lambda\),\(\mu)\leq 1- (1-\lambda)(1-\mu)[1-\log (1-\lambda)(1-\mu)]\). The exact value of f is presently unknown for every case in which \(\lambda +\mu \geq 1\) and \(\max \{\lambda,\mu \}<1\).
- A correlational inequality for linear extensions of a poset
- scientific article; zbMATH DE number 3232020 (Why is no real title available?)
- On linear extension majority graphs of partial orders
- On the family of linear extensions of a partial order
- The XYZ conjecture and the FKG inequality
- Two combinatorial applications of the Aleksandrov-Fenchel inequalities
- On proportional transitivity of ordered sets
- Balanced pairs in partial orders
- A frequentist view on cycle-transitivity of reciprocal relations
- Preference modelling, a matter of degree
- Toom's partial order is transitive
- scientific article; zbMATH DE number 1153387 (Why is no real title available?)
- Cycle-free cuts of mutual rank probability relations.
- Being a proper trapezoid ordered set is a comparability invariant
- On the cycle-transitivity of the mutual rank probability relation of a poset
- Linear extension majority cycles on partial orders
- Linear extension majority cycles in height-1 orders
- Linear extension majority cycles for small (n\(\leq 9)\) partial orders
- Counting linear extension majority cycles in partially ordered sets on up to 13 elements
This page was built for publication: Proportional transitivity in linear extensions of ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059089)
