Document Type
Article
Publication Date
4-8-2006
Publication Title
Journal of Pure and Applied Algebra
Abstract
We consider families of sparse Laurent polynomials f1, . . . , fn with a finite set of common zeros Z f in the torus Tn = (C − {0})n. The global residue assigns to every Laurent polynomial g the sum of its Grothendieck residues over Z f . We present a new symbolic algorithm for computing the global residue as a rational function of the coefficients of the fi when the Newton polytopes of the fi are full-dimensional. Our results have consequences in sparse polynomial interpolation and lattice point enumeration in Minkowski sums of polytopes.
Repository Citation
Soprunov, Ivan, "Global Residues for Sparse Polynomial Systems" (2006). Mathematics and Statistics Faculty Publications. 272.
https://engagedscholarship.csuohio.edu/scimath_facpub/272
DOI
10.1016/j.jpaa.2006.06.012
Version
Postprint
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Volume
209
Issue
2
