Abstract
We show that there is no universal bound of Gröbner bases when the coefficient ring is Z. A similar result where the coefficient ring is k[z], k a field, was proved by [1]. While the coefficient ring is a field, such bounds always exist as proved by Weispfenning [16].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abhyankar and W. Li, On the Jacobian Conjecture: A New Approach Via Gröbner Bases, J. Pure Appl. Algebra, 61, 1989, pp. 211–222.
H. Bass, The Jacobian Conjecture and Inverse Degrees, Arithmetic and Geometry II, (edited by M. Artin and J. Tate), Birkhauser, 1983.
D. Bayer, The Division Algorithm and Hilbert Scheme, Ph. D. Thesis, Harvard University, 1982.
D. Bayer and M. Stillman, A Criterion for Detecting m-Regularity, Invent. Math. 87, 1987, pp. 1–11.
B. Buchberger, Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory, Chapter 6 in: Multidimensional System Theory, (edited by H. K. Bose) D. Reidel Pub. Comp., 1985
B. Buchberger, Applications of Gröbner Bases in Non-Linear Computational Geometry,Mathematical Aspects of Scientific Software, (edited by J. Rice), Springer-Verlag, 1988.
B. Buchberger, A Criterion for Detecting Unnecessary Reductions in the Construction of Gröbner-Bases, Symbolic and Algebraic Computation, (edited by E. W. Ng), Lecture Notes in Computer Science 72, Springer-Verlag, 1979, pp.3–21.
B. Buchberger, A Note on the Complexity of Constructing Gröbner-Bases, Proc. EUROCAL ’83, (edited by J. van Hulzen), Lecture Notes in Computer Science 162, Springer-Verlag, 1983, pp. 137–145
P. Gianni, B. Trager and G. Zacharias, Gröbner Bases and Primary Decomposition of Polynomial Ideals, J. Symbolic Comput., 6, 1988, pp. 149–167.
M. Giusti, Some Effectivity Problems in Polynomial Ideal Theory, Proc. EUROSAM 84, (edited by J. Fitch), Lecture Notes in Computer Science 174, Springer-Verlag, 1984, pp.159–171.
D. Lazard, Gröbner Bases, Gaussian Elimination and Resulution of Systems of Algebraic Equations, Proc. EUROCAL’83 (edited by J. van Hulzen), Lecture Notes in Computer Science 162, Springer-Verlag, 1983, pp.146–156.
W. Li, Gröbner Bases and Automorphisms of Polynomial Rings, Ph. D. Thesis, Purdue University, 1990,
B. Mishra and C. Yap, Notes on Gröbner Bases, Inform. Sci., 48, 1989, pp. 219–252.
H. Möller and F. Mora, Upper and Lower Bounds for the Degree of Gröbner Bases,Proc. EUROSAM 84, (edited by J. Fitch), Lecture Notes in Computer Science 174, Springer-Verlag, 1984, pp. 172–183.
W. Trinks, Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen, J. Number Theory, 10, 1978, pp. 475–488.
V. Weispfenning, Some bounds for the construction of Gröbner bases, Proc. AAECC-4, (edited by Th. Beth and M. Clausen), Lecture Notes in Computer Science 307, Springer-Verlag, 1988, pp. 195–201.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Li, W. (1994). Degree Bounds of Gröbner Bases. In: Bajaj, C.L. (eds) Algebraic Geometry and its Applications. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2628-4_30
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2628-4_30
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7614-2
Online ISBN: 978-1-4612-2628-4
eBook Packages: Springer Book Archive