The University of Sydney - School of Mathematics and Statistics

Let $f: \K^n \to \K$ be a polynomial, $\K=\R, \,\C$. 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$.

Reaching generalized critical values of a polynomial joint work with Zbigniew Jelonek

Krzysztof Kurdyka, Savoie University, France

Abstract

Let f: K^n --->K be a polynomial, K=R, C. 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.