Balancing extensions via Brunn-Minkowski

DOI10.1007/BF01275670zbMath0735.06004MaRDI QIDQ1181013

Jeffry Kahn, Nathan Linial

Publication date: 27 June 1992

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

finite posetBrunn-Minkowski Theorem

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Related Items

The Brunn-Minkowski inequality, Balancing pairs and the cross product conjecture, Two Double Poset Polytopes, Balance constants for Coxeter groups, The \(1/3-2/3\) Conjecture for Coxeter groups, Sorting probability for large Young diagrams, Sorting under partial information (without the ellipsoid algorithm)., A Brunn-Minkowski inequality for the integer lattice, The Brunn-Minkowski inequality, Minkowski's first inequality, and their duals, On Generalized Comparison-Based Sorting Problems, Balanced pairs in partial orders

Cites Work

• Partitions of mass-distributions and of convex bodies by hyperplanes
• Two poset polytopes
• How good is the information theory bound in sorting?
• Balancing poset extensions
• The Information-Theoretic Bound is Good for Merging