Abstract
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.
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.
Similar content being viewed by others
References
Alvandi, P., Chen, C., Moreno Maza, M.: Computing the limit points of the quasi-component of a regular chain in dimension one. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2013. LNCS, vol. 8136, pp. 30–45. Springer, Heidelberg (2013)
Boulier, F., Lazard, D., Ollivier, F., Petitot, M.: Computing representations for radicals of finitely generated differential ideals. Appl. Algebra Eng. Commun. Comput. 20(1), 73–121 (2009)
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms, 2nd edn. Springer (1996)
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)
Hubert, E.: Factorization-free decomposition algorithms in differential algebra. J. Symb. Comput. 29(4-5), 641–662 (2000)
Kalkbrener, M.: Algorithmic properties of polynomial rings. J. Symb. Comput. 26(5), 525–581 (1998)
Lemaire, F., Moreno Maza, M., Xie, Y.: The RegularChains library. In: Maple 10, Maplesoft, Canada (2005), http://www.regularchains.org
Marcus, S., Moreno Maza, M., Vrbik, P.: On Fulton’s algorithm for computing intersection multiplicities. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2012. LNCS, vol. 7442, pp. 198–211. Springer, Heidelberg (2012)
Wang, D.K.: The Wsolve package, http://www.mmrc.iss.ac.cn/~dwang/wsolve.html
Wang, D.M.: Epsilon 0.618, http://www-calfor.lip6.fr/~wang/epsilon
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alvandi, P., Chen, C., Marcus, S., Maza, M.M., Schost, É., Vrbik, P. (2014). Doing Algebraic Geometry with the RegularChains Library. In: Hong, H., Yap, C. (eds) Mathematical Software – ICMS 2014. ICMS 2014. Lecture Notes in Computer Science, vol 8592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_71
Download citation
DOI: https://doi.org/10.1007/978-3-662-44199-2_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44198-5
Online ISBN: 978-3-662-44199-2
eBook Packages: Computer ScienceComputer Science (R0)