A Sparse Effective Nullstellensatz

AbstractWe present bounds for the sparseness in the Nullstellensatz. These bounds can give a much sharper characterization than degree bounds of the monomial structure of the polynomials in the Nullstellensatz in case that the input system is sparse. As a consequence we derive a degree bound which can substantially improve the known ones in case of a sparse system.In addition we introduce the notion of algebraic degree associated to a polynomial system of equations. We obtain a new degree bound which is sharper than the known ones when this parameter is small. We also improve the previous effective Nullstellensätze in case the input polynomials are quadratic.Our approach is completely algebraic, and the obtained results are independent of the characteristic of the base field