Sets of Uniqueness and Additivity in Integer Lattices
A mathematical formulation is provided for inversion problems in which local structures of finite subsets of integer lattices are to be deduced from point counts in prescribed linear manifolds of an n-dimensional space. Notions of uniqueness and additivity for finite lattice sets are defined and characterized by point configurations and by aspects of fractional subsets of the lattice. The latter feature leads to analysis by interior point linear programming, which appears to be a very effective as well as efficient approximation approach to discrete inversion problems.
KeywordsInterior Point Method Extreme Solution Linear Manifold Integer Lattice Linear Programming Approach
Unable to display preview. Download preview PDF.
- P. Gritzmann and M. Nivat, Eds., “Discrete Tomography: Algorithms and Complexity,” Dagstuhl Seminar Report 165, Internat. Beg. Forsch. Infor., Schloss Dagstuhl, Germany, 1997.Google Scholar
- P. C. Fishburn, Mathematics of Decision Theory (Mouton, Paris), 1972.Google Scholar
- R. J. Vanderbei, An interior point code for quadratic programming, SOR 94–15, Princeton University, Princeton, NJ, 1994.Google Scholar