An Algorithm for Computing the Limit Points of the Quasi-component of a Regular Chain

Abstract

For a regular chain R, we propose an algorithm which computes the (non-trivial) limit points of the quasi-component of R, that is, the set W(R) W(R). Our procedure relies on Puiseux series expansions and does not require to compute a system of generators of the saturated ideal of R. We focus on the case where this saturated ideal has dimension one and we discuss extensions of this work in higher dimensions. We provide experimental results illustrating the benefits of our algorithms.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…