Research Interests:
Without Abstract
Research Interests:
Abstract: Given a system of $ n+ 1$ generic Laurent polynomials, for $ i\,=\, 1,\ ldots, n+ 1$, $ $\ eqlabel (\ InputSystem) f_i (\ x)\ quad=\ quad\ sum_ {q\ in\ A_i} c_ {iq}\, x^ q;\ qquad q\,=\,(q_1,\ ldots, q_n);\ qquad\ x^ q\,=\,... more
Abstract: Given a system of $ n+ 1$ generic Laurent polynomials, for $ i\,=\, 1,\ ldots, n+ 1$, $ $\ eqlabel (\ InputSystem) f_i (\ x)\ quad=\ quad\ sum_ {q\ in\ A_i} c_ {iq}\, x^ q;\ qquad q\,=\,(q_1,\ ldots, q_n);\ qquad\ x^ q\,=\, x_1^{q_1} x_2^{q_2}\ cdots x_n^{q_n};\ eqno (\ InputSystem) $ $ with (finite) support sets $\ A_i\ subset L $, where $ L $ is some affine lattice isomorphic to $\ Z^ n $; we consider algorithms for the {\ it Newton resultant} $ R (f_1, f_2,\ ldots, f_ {n+ 1}) $. This is the unique (up to sign) irreducible polynomial with ...