A Combinatorial Proof of the Effective Nullstellensatz

14Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Let I be an ideal in the affine multi-variate polynomial ring A = K[x1,…, xn]. Beginning with the work of Brownawell, there has been renewed interest in recent years in using the degrees of polynomials which generate I to bound the degree D such that:. g ε{lunate} I ⇒ gD ε{lunate} I. This paper will prove the degree bound D using only counting arguments for the ideal I. This provides the first combinatorial proof of the effective Nullstellensatz. © 1993 Academic Press. All rights reserved.

Cite

CITATION STYLE

APA

Dubé, T. W. (1993). A Combinatorial Proof of the Effective Nullstellensatz. Journal of Symbolic Computation, 15(3), 277–296. https://doi.org/10.1006/jsco.1993.1020

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free