Balancing extensions via Brunn-Minkowski

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

$$1/2e< p(x< y)< 1 - 1/2e.$$

A similar result was independently found by A. Karzanov and L. G. Khachiyan

This is a preview of subscription content, access via your institution.

References

  1. [1]

    H. Buseman:Convex surfaces, Interscience, New York, 1958.

    Google Scholar 

  2. [2]

    M. Fredman: How good is the information theory bound in sorting?,Theoretical Computer Science 1 (1976), 355–361.

    Google Scholar 

  3. [3]

    B. Grünbaum: Partitions of mass-distributions and of convex bodies by hyperplanes,Pac. J. Math. 10 (1960), 1257–1261.

    Google Scholar 

  4. [4]

    J. Kahn, andM. Saks: Balancing poset extensions,Order 1 (1984), 113–126.

    Google Scholar 

  5. [5]

    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).

    Google Scholar 

  6. [6]

    N. Linial: The information theoretic bound is good for merging,SIAM J. Comp. 13 (1984), 795–801.

    Google Scholar 

  7. [7]

    B. S. Mityagin: Two inequalities for volumes of convex bodies,Math. Notes 5 (1968), 61–65.

    Google Scholar 

  8. [8]

    R. P. Stanley: Two poset polytopes,Discrete and Computational Geom. 1 (1986), 9–23.

    Google Scholar 

Download references

Author information

Affiliations

Authors

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.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kahn, J., Linial, N. Balancing extensions via Brunn-Minkowski. Combinatorica 11, 363–368 (1991). https://doi.org/10.1007/BF01275670

Download citation

AMS subject classification (1991)

  • 06 A 07
  • 52 A 38
  • 68 P 10
  • 68 R 05