Skip to main content
  • 226 Accesses

Abstract

Given a generic m by n matrix A, a lattice point h in ℤn is a neighbor of the origin if the body {x: Axb}, with b1 = max {0, aih }, i = 1, …,m, contains no lattice point other than 0 and h. The set of neighbors, N(A), is finite and 0-symmetric. We show that if A′ is another matrix of the same size with the property that sign a i h = sign a i h for every i and every hN(A), then A′ has precisely the same set of neighbors as A. The collection of such matrices is a polyhedral cone, described by a finite set of linear inequalities, each such inequality corresponding to a generator of one of the cones C i = pos {hN(A): a i h < 0}. Computational experience shows that C i has “few” generators. We demonstrate this in the first nontrivial case n = 3, m = 4.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bárány, I., R. Howe, H. E. Scarf. 1994. The complex of maximal lattice free simplices. Math. Programming 66 273–281.

    Article  Google Scholar 

  • ———, H. E. Scarf, D. Shallcross. 1998. The topological structure of maximal lattice free convex bodies: the general case. Math. Programming 80 1–15.

    Article  Google Scholar 

  • Barvinok, A. 1995. Personal communication.

    Google Scholar 

  • Graver, J. E. 1975. On the foundations of linear and integral programming, I. Math. Programming 8 207–266.

    Article  Google Scholar 

  • Kannan, R. 1990. Test sets for integer programs with ∀, ∃ sentences. DI-MACS series, vol. 1. AMS, 39–47.

    Google Scholar 

  • Lovász, L. 1989. Geometry of numbers and integer programming. M. Iri and K. Tanabe, eds. Mathematical Programming: Recent Developments and Applications. Kluwer Acad., Norwell, MA. 177–210.

    Google Scholar 

  • Scarf, H. E. 1986. Neighborhood systems for production sets with indivisibilities. Econometrica 54 507–532.

    Article  Google Scholar 

  • Schrijver, A. 1986. Theory of Linear and Integer Programming. John Wiley & Sons, New York.

    Google Scholar 

  • Shallcross, D. 1992. Neighbors of the origin for four by three matrices. Math. Oper. Res. 17 608–614.

    Article  Google Scholar 

  • Sturmfcls, B., R. Thomas. 1994. Variation of cost function in integer programming, manuscript, Cornell University, Ithaca, NY.

    Google Scholar 

  • White, P. 1983. Discrete activity analysis. Ph.D. Thesis, Yale University, Department of Economics, New Haven, CT.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Copyright information

© 2008 Herbert Scarf

About this chapter

Cite this chapter

Bárány, I., Scarf, H. (2008). Matrices with Identical Sets of Neighbors. In: Yang, Z. (eds) Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research. Palgrave Macmillan, London. https://doi.org/10.1057/9781137024411_10

Download citation

Publish with us

Policies and ethics