Doing Algebraic Geometry with the RegularChains Library
Traditionally, Groebner bases and cylindrical algebraic decomposition are the fundamental tools of computational algebraic geometry. Recent progress in the theory of regular chains has exhibited efficient algorithms for doing local analysis on algebraic varieties. In this note, we present the implementation of these new ideas within the module AlgebraicGeometryTools of the RegularChains library. The functionalities of this new module include the computation of the (non-trivial) limit points of the quasi-component of a regular chain. This type of calculation has several applications like computing the Zarisky closure of a constructible set as well as computing tangent cones of space curves, thus providing an alternative to the standard approaches based on Groebner bases and standard bases, respectively. From there, we have derived an algorithm which, under genericity assumptions, computes the intersection multiplicity of a zero-dimensional variety at any of its points. This algorithm relies only on the manipulations of regular chains.
KeywordsAlgebraic geometry regular chains local analysis
Unable to display preview. Download preview PDF.
- 3.Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms, 2nd edn. Springer (1996)Google Scholar
- 4.Della Dora, J., Dicrescenzo, C., Duval, D.: About a new method for computing in algebraic number fields. In: Buchberger, B. (ed.) ISSAC 1985 and EUROCAL 1985. LNCS, vol. 203, pp. 289–290. Springer, Heidelberg (1985)Google Scholar
- 7.Lemaire, F., Moreno Maza, M., Xie, Y.: The RegularChains library. In: Maple 10, Maplesoft, Canada (2005), http://www.regularchains.org
- 9.Wang, D.K.: The Wsolve package, http://www.mmrc.iss.ac.cn/~dwang/wsolve.html
- 10.Wang, D.M.: Epsilon 0.618, http://www-calfor.lip6.fr/~wang/epsilon