Reaching generalized critical values of a polynomial
classification
🧮 math.AG
keywords
criticalgeneralizedvaluesalgorithmpolynomialalongarcscomplex
read the original abstract
Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.