Sets of Uniqueness and Additivity in Integer Lattices
Peter C. Fishburn, Lawrence A. Shepp · Applied and numerical harmonic analysis · 1999
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. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.