Abstract
We give a simple proof, based on the Brunn-Minkowski Theorem, of Theorem. Inany finite poset P not a total order there are elementsx, y such that
A similar result was independently found by A. Karzanov and L. G. Khachiyan
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Buseman:Convex surfaces, Interscience, New York, 1958.
M. Fredman: How good is the information theory bound in sorting?,Theoretical Computer Science 1 (1976), 355–361.
B. Grünbaum: Partitions of mass-distributions and of convex bodies by hyperplanes,Pac. J. Math. 10 (1960), 1257–1261.
J. Kahn, andM. Saks: Balancing poset extensions,Order 1 (1984), 113–126.
L. G. Khachiyan: Optimal algorithms in convex programming, decomposition and sorting, in:Computers and Decision Problems (Ju. Jaravlev, ed.), Moscow, Nauka, 1989, pp. 161–205 (Russian).
N. Linial: The information theoretic bound is good for merging,SIAM J. Comp. 13 (1984), 795–801.
B. S. Mityagin: Two inequalities for volumes of convex bodies,Math. Notes 5 (1968), 61–65.
R. P. Stanley: Two poset polytopes,Discrete and Computational Geom. 1 (1986), 9–23.
Author information
Authors and Affiliations
Additional information
Supported by NSF Grant MCS 83-01867, AFOSR Grant 0271, and a Sloan Research Fellowship. This research was done while the author was visiting IBM Research Almaden.
Supported in part by grants from the Israel-US Binational Science Foundation and the Israeli Academy of Sciences.