Related papers: The real non-attractive fixed point conjecture and…

Every linear, quadratic or cubic polynomial having all real zeros is the derivative of a polynomial having all real zeros. The statement is false for higher degree polynomials. In particular, not every fourth degree polynomial with real…

Let $P_{<n}(z)$ be the Rudin-Shapiro polynomial of degree $n-1$. We show that $|P_{<n}(z)|\le \sqrt{6n-2}-1$ for all $n\ge0$ and $|z|=1$, confirming a longstanding conjecture. This bound is sharp in the case when $n=(2\cdot 4^k+1)/3$ and…

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…

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…

In this follow-up paper, we again inspect a surprising relationship between the set of fixed points of a polynomial map $\varphi_{d, c}$ defined by $\varphi_{d, c}(z) = z^d + c$ for all $c, z \in \mathcal{O}_{K}$ or $\in \mathbb{Z}_{p}$ or…

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…

Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…

The famous Descartes' rule of signs from 1637 giving an upper bound on the number of positive roots of a real univariate polynomials in terms of the number of sign changes of its coefficients, has been an indispensable source of inspiration…

In this paper we give a different proof of Kuz'min's result on the number of irreducible polynomials with the first two coefficients fixed. Our technique is to relate the question to the number of points on a curve, and to calculate the…

This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying…

We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

Let $p(w)=(w-w_{1})(w-w_{2})(w-w_{3}),$with $\func{Re}w_{1}<\func{Re}w_{2}<\func{Re}w_{3}$. Assume that if the critical points of $p$ are not identical, then they cannot have equal real parts. Define the ratios…

This paper discusses the location of zeros of polynomials in a polynomial sequence $\{P_n(z)\}$ generated by a three-term recurrence relation of the form $P_n(z)+ B(z)P_{n-1}(z) +A(z) P_{n-k}(z)=0$ with $k>2$ and the standard initial…

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

Let $P: {\mathbb C} \to {\mathbb C}$ be a polynomial map with disconnected filled Julia set $K_P$ and let $z_0$ be a repelling or parabolic periodic point of $P$. We show that if the connected component of $K_P$ containing $z_0$ is…

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…

Let $F$ be a number field, $O_F$ the integral closure of $\mathbb{Z}$ in $F$ and $P(T) \in O_F[T]$ a monic separable polynomial such that $P(0) \not=0$ and $P(1) \not=0$. We give precise sufficient conditions on a given positive integer $k$…