TY - JOUR
T1 - Algorithms and Bounds for Polynomial Rings
AU - van den Dries, Lou
PY - 1979/1/1
Y1 - 1979/1/1
N2 - This chapter discusses algorithms and bounds for polynomial rings. A lemma discussed in the chapter combines with the well-known techniques and results of commutative algebra—local–global principles, Krull's intersection theorem, and the primitive element theorem—to obtain many of the bounds. The chapter describes the nonstandard approach. The results on bounds in their nonstandard formulation express very simple relations between two rings, a polynomial ring K[X] and a certain extension K[X]*. The lemma implies that a number A can be computed from (n,d) such that if f ∞ (f1,…fκ), then f = ∑hifi for certain hi ∞ K[X] of degree at most A.
AB - This chapter discusses algorithms and bounds for polynomial rings. A lemma discussed in the chapter combines with the well-known techniques and results of commutative algebra—local–global principles, Krull's intersection theorem, and the primitive element theorem—to obtain many of the bounds. The chapter describes the nonstandard approach. The results on bounds in their nonstandard formulation express very simple relations between two rings, a polynomial ring K[X] and a certain extension K[X]*. The lemma implies that a number A can be computed from (n,d) such that if f ∞ (f1,…fκ), then f = ∑hifi for certain hi ∞ K[X] of degree at most A.
UR - http://www.scopus.com/inward/record.url?scp=77957669650&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77957669650&partnerID=8YFLogxK
U2 - 10.1016/S0049-237X(08)71624-0
DO - 10.1016/S0049-237X(08)71624-0
M3 - Article
AN - SCOPUS:77957669650
SN - 0049-237X
VL - 97
SP - 147
EP - 157
JO - Studies in Logic and the Foundations of Mathematics
JF - Studies in Logic and the Foundations of Mathematics
IS - C
ER -