Abstract
Let (P, ≤) be a finite poset (partially ordered set), where P has cardinality n. Consider linear extensions of P as permutations x1x2⋯xn in one-line notation. For distinct elements x, y ∈ P, we define ℙ(x ≺ y) to be the proportion of linear extensions of P in which x comes before y. For \(0\leq \alpha \leq \frac {1}{2}\), we say (x, y) is an α-balanced pair if α ≤ ℙ(x ≺ y) ≤ 1 − α. The 1/3–2/3 Conjecture states that every finite partially ordered set which is not a chain has a 1/3-balanced pair. We make progress on this conjecture by showing that it holds for certain families of posets. These include lattices such as the Boolean, set partition, and subspace lattices; partial orders that arise from a Young diagram; and some partial orders of dimension 2. We also consider various posets which satisfy the stronger condition of having a 1/2-balanced pair. For example, this happens when the poset has an automorphism with a cycle of length 2. Various questions for future research are posed.
Similar content being viewed by others
References
Aigner, M.: A note on merging. Order 2(3), 257–264 (1985)
Brightwell, G.: Semiorders and the 1/3–2/3 conjecture. Order 5(4), 369–380 (1989)
Brightwell, G.: Balanced pairs in partial orders. Discret. Math. 201(1–3), 25–52 (1999)
Brightwell, G., Felsner, S., Trotter, W.T.: Balancing pairs and the cross product conjecture. Order 12(4), 327–349 (1995)
Fredman, M.L.: How good is the information theory bound in sorting? Theor. Comput. Sci. 1(4), 355–361 (1976)
Ganter, B., Hafner, G., Poguntke, W.: On linear extensions of ordered sets with a symmetry. Discret. Math. 63, 153–156 (1987)
Kahn, J., Saks, M.: Balancing poset extensions. Order 1(2), 113–126 (1984)
Kislitsyn, S.: Finite partially ordered sets and their associated sets of permutation. Matematicheskiye Zametki 4, 511–518 (1968)
Linial, N.: The information-theoretic bound is good for merging. SIAM J. Comput. 13(4), 795–801 (1984)
Peczarski, M.: The gold partition conjecture. Order 23(1), 89–95 (2006)
Peczarski, M.: The gold partition conjecture for 6-thin posets. Order 25(2), 91–103 (2008)
Trotter, W.T., Gehrlein, W.G., Fishburn, P.C.: Balance theorems for height-2 posets. Order 9(1), 43–53 (1992)
Zaguia, I.: The 1/3 − 2/3 conjecture for n-free ordered sets. Electron. J. Comb. 19(2), 1–5 (2012)
Zaguia, I.: The 1/3-2/3 conjecture for ordered sets whose cover graph is a forest. (2016). arXiv:1610.00809
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Olson, E.J., Sagan, B.E. On the 1/3–2/3 Conjecture. Order 35, 581–596 (2018). https://doi.org/10.1007/s11083-017-9450-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-017-9450-3