We 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 subst
A generic effective Nullstellensatz
β Scribed by Ravikiran Rajagopal; Lee C. Potter
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 261 KB
- Volume
- 397
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
Kollar's sharp effective Nullstellensatz, which is independent of the number of polynomials, is shown to be a generically pessimistic bound. A generic effective Nullstellensatz is proven. The generic bound is approximately inversely proportional to the number of polynomials; further, the bound is linear, rather than exponential, in the degrees of the polynomials. The generic effective Nullstellensatz provides for minimum required equalization filter orders in signal and image processing.
π SIMILAR VOLUMES
Let \(I\) be an ideal in the affine multi-variate polynomial ring \(\mathcal{A}=K\left[x_{1}, \ldots, x_{n}\right]\). 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: