Solving discrete zero point problems (Q2494512): Difference between revisions

The present paper contributes to the theoretical tools for discrete optimization methods. Namely, the existence of a discrete zero point of a function from an \(n\)-dimensional integer lattice to \(n\)-dimensional Euclidean space is shown. The result is derived by two combinatorial proofs under different boundary conditions, where both proofs are based on simplicial algorithm giving an effective construction method for the generation of the zero point within a finite number of steps.