Related papers: Arithmetic of Unicritical Polynomial Maps

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite…

Given any n-tuple of complex numbers, one can canonically define a polynomial of degree n+1 that has the entries of this n-tuple as its critical points. In 2002, Beardon, Carne, and Ng studied a map $\theta\colon \mathbb{C}^n\to…

Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…

Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…

We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…

This note will describe an effective procedure for constructing critically finite real polynomial maps with specified combinatorics.

We study the dynamics of a class of endomorphisms of A^N which restricts, when N = 1, to the class of unicritical polynomials. Over the complex numbers, we obtain lower bounds on the sum of Lyapunov exponents, and a statement which…

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

The critical point degree of a periodic graph operator is the number of critical points of its complex Bloch variety. Determining it is a step towards the spectral edges conjecture and more generally understanding Bloch varieties. Previous…

We show that the set of conjugacy classes of cubic polynomials with a prefixed critical point, of preperiod $k\geq 1$, is an irreducible algebraic curve. We also establish an analogous result for quadratic rational maps. We then study a…

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…

Some properties of the relation between the singular point set and the non-proper value curve of polynomial maps of $\mathbb{C}^2$ are expressed in terms of Newton-Puiseux expansions.

We consider the question about the number of master integrals for a multiloop Feynman diagram. We show that, for a given set of denominators, this number is totally determined by the critical points of the polynomials entering either of the…

This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…

Consider a random polynomial $Q_n$ of degree $n+1$ whose zeroes are i.i.d. random variables $\xi_0,\xi_1,\ldots,\xi_n$ in the complex plane. We study the pairing between the zeroes of $Q_n$ and its critical points, i.e. the zeroes of its…

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…