Related papers: Arithmetic of Unicritical Polynomial Maps

We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…

Let V $\subset$ C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at the points of V is a cornerstone of several algorithms in real…

We generalize univariate multipoint evaluation of polynomials of degree n at sublinear amortized cost per point. More precisely, it is shown how to evaluate a bivariate polynomial p of maximum degree less than n, specified by its n^2…

We give the classification, up to homeomorphisms, of reduced complex polynomials with 2 variables with one critical value.

We consider manifolds $M^{2n}$ which admit smooth maps into a connected sum of $S^1\times S^n$ with only finitely many critical points, for $n\in\{2,4,8\}$, and compute the minimal number of critical points.

We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…

This is a preliminary investigation of the geometry and dynamics of rational maps with only two critical points. (originally titled ``On Bicritical Rational Maps'' in September 1997; revised and retitled April 1999)

There is shown how to compute the sum of indices of critical points of rank two for polynomial selmaps of R^4

We describe how to compute topological objects associated to a polynomial map of several complex variables with isolated singularities. These objects are: the affine critical values, the affine Milnor numbers for all irregular fibers, the…

We study a class of one-dimensional full branch maps admitting two indifferent fixed points as well as critical points and/or unbounded derivative. Under some mild assumptions we prove the existence of a unique invariant mixing absolutely…

Let $\Sigma(f)$ be critical points of a polynomial $f \in \mathbb{K}[x,y]$ in the plane $\mathbb{K}^2$, where $\mathbb{K}$ is $\mathbb{R}$ or $\mathbb{C}$. Our goal is to study the critical point map $\mathfrak{S}_d$, by sending polynomials…

We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…

A polynomial $f$ of degree $d$ and coefficients in an algebraically closed field $k$ defines a morphism $f:\mathbb{P}^1_k\longrightarrow\mathbb{P}^1_k$ which, if char$(k)\nmid d$, is unramified outside a finite set of points in the image:…

The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…

In this article, we prove that every unicritical polynomial map that has only rational multipliers is either a power map or a Chebyshev map. This provides some evidence in support of a conjecture by Milnor concerning rational maps whose…

We study the number of real critical points of a cyclotomic polynomial $\Phi_{n}(x)$, that is, the real roots of $\Phi_{n}^{\prime}(x)$. As usual, one can, without losing generality, restrict $n$ to be the product of distinct odd primes,…

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.

We prove a complex polynomial of degree $n$ has at most $\lceil n/2 \rceil$ attractive fixed points lying on a line. We also consider the general case.

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.