The Structure of the Complex of Maximal Lattice Free Bodies for a Matrix of Size (n + 1) × n

Herbert Scarf

Chapter 13 in Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research, 2008, pp 227-258 from Palgrave Macmillan

Abstract: Abstract The complex of maximal lattice free bodies associated with a well behaved matrix A of size (n + 1) × n is generated by a finite set of simplicies, K0(A), of the form {0, h1, …, hk},with k ≤ n, and their lattice translates. The simplicies in K0(A) are selected so that the plane a0x = 0, with ao the first row of A, passes through the vertex 0. The collection of simplicies {h1,…,hk} is denoted by Top. Various properties of Top are demonstrated, including the fact that no two interior faces of Top are lattice translates of each other. Moreover, if g is a generator of the cone generated by the set of neighbors {h} with a0h> 0, then the set of simplicies of Top which contain g is the union of linear intervals of simplicies with special features. These features lead to an algorithm for calculating the simplicies in K0(A)as a0 varies and the plane a0x = 0 passes through the generator ɡ.

Keywords: Lattice Point; Large Firm; Simplicial Complex; Main Diagonal; Boundary Interval (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:palchp:978-1-137-02441-1_13

Ordering information: This item can be ordered from
http://www.palgrave.com/9781137024411

DOI: 10.1057/9781137024411_13

Access Statistics for this chapter

More chapters in Palgrave Macmillan Books from Palgrave Macmillan
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().