Abstract
The determination of the dimension of an algebraic variety is a problem that, in principle, can be solved in an algorithmic way. If the variety is projective, this can be made through the computation of the Hilbert polynomial; if it is affine, consider a completion of the affine variety; the completion may have larger dimension than the affine variety, but in this case it may have irreducible components contained in the hyperplane at infinity. This can be checked, and if this happens, a decomposition into irreducible components reduces the problem to the other case. Moreover, if the completion of the affine variety is made with respect to the affine immersion given by a standard basis (also called Gröbner basis) with respect to an homogeneous term ordering, no irreducible component may be contained in the hyperplane at infinity. Hence, a standard basis computation is sufficient to decide the question.
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
D. Bayer, A. Galligo,Inverse systems and equidimensional decomposition of polynomial ideals ,(in preparation).
D. Bayer, A. Galligo, M. Stillman,Computation of the primary decomposition of polynomial ideals ,(in preparation).
H. Cohn,An explicit modular equation in two variables and Hilbert’s Twelfth Problem, Math, of Comp. 38 (1982), 227–236.
H. Cohn, J. Deutsch,An explicit modular equation in two variables for Q[???3], Math.of Comp. 50 (1988), 55T-568.
A. Galligo, L. Pottier, C. Traverso,Greater Easy Common Divisor and standard basis completion algorithms ,in “ISSAC 88,” Lecture Notes in Computer Science (to appear), Springer Verlag, Berlin-Heidelberg-New York, 1988.
M. Giusti,Combinatorial dimension theory of algebraic varieties ,Journal of Symbolic Computation (to appear).
P. Gianni, B. Trager, G. Zacharias,Gröbner Basis and Primary Decomposition of Polynomial Ideals ,Journal of Symbolic Computation.
M. Möller, T. Mora,The computation of Hilbert function ,in “EUROCAL 83,” Lecture Notes in Computer Science 162, Springer Verlag, Berlin-Heidelberg-New York, 1983, pp. 157–167.
T. Mora,An algorithm to compute the equations of tangent cones ,in “EUROCAM 82,” Lecture Notes in Computer Science 144 , Springer Verlag, Berlin-Heidelberg-New York, 1982, pp. 158–166.
C.Traverso,Gröbner trace algorithms ,in “ISSAC 88,” Lecture Notes in Computer Science (to appear), Springer Verlag, Berlin-Heidelberg-New York, 1988.
C. Traverso,Experimenting the Gröbner basis algorithm with the AlPi system ,(submitted to ISSAC 89).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York Inc.
About this paper
Cite this paper
Galligo, A., Traverso, C. (1989). Practical Determination of the Dimension of an Algebraic Variety. In: Kaltofen, E., Watt, S.M. (eds) Computers and Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9647-5_6
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9647-5_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97019-6
Online ISBN: 978-1-4613-9647-5
eBook Packages: Springer Book Archive