TY - JOUR
T1 - Global residues for sparse polynomial systems
AU - Soprunov, Ivan
PY - 2007/5/1
Y1 - 2007/5/1
N2 - We consider families of sparse Laurent polynomials f1, ..., fn with a finite set of common zeros Zf in the torus Tn = (C - {0})n. The global residue assigns to every Laurent polynomial g the sum of its Grothendieck residues over Zf. 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. © 2006 Elsevier Ltd. All rights reserved.
AB - We consider families of sparse Laurent polynomials f1, ..., fn with a finite set of common zeros Zf in the torus Tn = (C - {0})n. The global residue assigns to every Laurent polynomial g the sum of its Grothendieck residues over Zf. 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. © 2006 Elsevier Ltd. All rights reserved.
UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=33846020024&origin=inward
UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=33846020024&origin=inward
U2 - 10.1016/j.jpaa.2006.06.012
DO - 10.1016/j.jpaa.2006.06.012
M3 - Article
SN - 0022-4049
VL - 209
SP - 383
EP - 392
JO - Journal of Pure and Applied Algebra
JF - Journal of Pure and Applied Algebra
IS - 2
ER -