Ideal Membership in Polynomial Rings over the Integers

@inproceedings{Aschenbrenner2004IdealMI,
  title={Ideal Membership in Polynomial Rings over the Integers},
  author={Matthias Aschenbrenner and Grete Hermann},
  year={2004}
}
We present a new approach to the ideal membership problem for polynomial rings over the integers: given polynomials f0, f1, . . . , fn ∈ Z[X], where X = (X1, . . . , XN ) is an N -tuple of indeterminates, are there g1, . . . , gn ∈ Z[X] such that f0 = g1f1 + · · · + gnfn? We show that the degree of the polynomials g1, . . . , gn can be bounded by (2d)2 O(N log(N+1)) (h+1) where d is the maximum total degree and h the maximum height of the coefficients of f0, . . . , fn. Some related questions… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 36 references

Bases of number fields with small height

D Roy, J L Thunder
Rocky Mountain J. Math. MR • 1996

A solution to Kronecker's problem

Applicable Algebra in Engineering, Communication and Computing • 1994

License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use IDEAL MEMBERSHIP IN POLYNOMIAL RINGS OVER THE INTEGERS 441 25. , Algebraic Number Theory

Graduate Texts in Mathematics • 1994

A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics

H Cohen
A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics • 1993

Graduate Texts in Mathematics

T Becker, V Weispfenning, Gröbner Bases
Graduate Texts in Mathematics • 1993

Length of polynomial ascending chains and primitive recursiveness

Moreno Socías
Math. Scand. MR • 1992

Similar Papers

Loading similar papers…