Abstract
AbstractGiven a regular chain, we are interested in questions like computing the limit points of its quasi-component, or equivalently, computing the variety of its saturated ideal. We propose techniques relying on linear changes of coordinates and we consider strategies where these changes can be either generic or guided by the input.KeywordsPrime IdealLimit PointLinear ChangeZariski ClosureTriangular DecompositionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call