CSpace  > 自动推理与认知研究中心
Doing algebraic geometry with the RegularChains library
Alvandi, Parisa1; Chen, Changbo2; Marcus, Steffen3; Maza, Marc Moreno1; Schost, Éric1; Vrbik, Paul1
2014
摘要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. © 2014 Springer-Verlag.
语种英语
DOI10.1007/978-3-662-44199-2_71
会议(录)名称4th International Congress on Mathematical Software, ICMS 2014
页码472-479
收录类别EI
会议地点Seoul, Korea, Republic of
会议日期August 5, 2014 - August 9, 2014