Improving the \(\frac{1}{3}\)-\(\frac{2}{3}\) conjecture for width two posets

DOI10.1007/s00493-020-4091-3zbMath1474.06006arXiv1811.01500OpenAlexW3110454864WikidataQ123021374 ScholiaQ123021374MaRDI QIDQ2036599

Ashwin Sah

Publication date: 29 June 2021

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.01500

zbMATH Keywords

poset\(\frac{1}{3}\)-\(\frac{2}{3}\) conjecturebalance conjecturewidth 2 poset

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Combinatorial inequalities (05A20) Extremal combinatorics (05D99)

Related Items

Extensions of the Kahn-Saks inequality for posets of width two ⋮ The cross-product conjecture for width two posets ⋮ Sorting probability for large Young diagrams ⋮ Sorting probability of Catalan posets

Cites Work

• The \(1/3\)-\(2/3\) conjecture for \(N\)-free ordered sets
• The gold partition conjecture for 6-thin posets
• Entropy and sorting.
• A note on merging
• Balance theorems for height-2 posets
• On linear extension majority graphs of partial orders
• How good is the information theory bound in sorting?
• Balanced pairs in partial orders
• A family of partially ordered sets with small balance constant
• On the \(1/3-2/3\) conjecture
• Semiorders and the 1/3-2/3 conjecture
• Balancing pairs and the cross product conjecture
• Balancing poset extensions
• The 1/3-2/3 conjecture for ordered sets whose cover graph is a forest
• Sorting under partial information (without the ellipsoid algorithm).
• Finite partially ordered sets and their corresponding permutation sets
• Chromatic polynomials and logarithmic concavity
• The Information-Theoretic Bound is Good for Merging
• The Worst Balanced Partially Ordered Sets—Ladders with Broken Rungs
• Poset entropy versus number of linear extensions: the width-2 case.