Skip to main content
Log in

The complex of maximal lattice free simplices

  • Published:
Mathematical Programming Submit manuscript

Abstract

The simplicial complexK(A) is defined to be the collection of simplices, and their proper subsimplices, representing maximal lattice free bodies of the form (x: Ax⩽b), withA a fixed generic (n + 1) ×n matrix. The topological space associated withK(A) is shown to be homeomorphic to ℝn, and the space obtained by identifying lattice translates of these simplices is homeorphic to then-torus.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • W.S. Massey,Singular Homology Theory (Springer-Verlag, New York, 1980).

    Google Scholar 

  • H. Scarf, The Computation of Economic Equilibria (with collaboration of Terje Hansen), Cowles Foundation Monograph No. 24 (Yale University Press, New Haven, 1973).

    Google Scholar 

  • H. Scarf, “Production sets with indivisibilities, Part I: Generalities,”Econometrica 49 (1) (1981a) 1–32.

    Google Scholar 

  • H. Scarf, “Production sets with indivisibilities, Part II: The case of two activities,”Econometrica 49 (2) (1981b) 395–423.

    Google Scholar 

  • H. Scarf, “Integral polyhedra in three space,”Mathematics of Operations Research 10 (3) (1985) 403–438.

    Google Scholar 

  • H. Scarf, “Neighborhood systems for production sets with indivisibilities,”Econometrica 54 (3) (1986) 507–532.

    Google Scholar 

  • H. Scarf and D. Shallcross, “Shortest integer vectors,”Mathematics of Operations Research 18 (3) (1993) 516–522.

    Google Scholar 

  • P. White, “Discrete activity analysis,” Ph.D. Thesis, Yale University, Department of Economics (1983).

Download references

Author information

Authors and Affiliations

Authors

Additional information

Corresponding author.

The first author was partially supported by Hungarian NSF grants 1907 and 1909, and also by U.S. NSF grant CCR-9111491. The research of the second author was supported by DMS9103608 and the third author by NSF grant SES9121936.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bárány, I., Howe, R. & Scarf, H.E. The complex of maximal lattice free simplices. Mathematical Programming 66, 273–281 (1994). https://doi.org/10.1007/BF01581150

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01581150

Keywords

Navigation