Related papers: Absolute root separation

Let $K$ be an algebraically closed field with an absolute value. This note gives an elementary proof of the classical result that the roots of a polynomial with coefficients in $K$ are continuous functions of the coefficients of the…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…

The presented analysis determines several new bounds on the roots of the equation $a_n x^n + a_{n-1} x^{n-1} + \cdots + a_0 = 0$ (with $a_n > 0$). All proposed new bounds are lower than the Cauchy bound max$\{1, \sum_{j=0}^{n-1} |a_j/a_n|…

In the present study, we propose necessary and sufficient assumptions on the coefficients in order to only get distinct real roots of polynomials.

We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…

We provide the law of large numbers for roots of finite free multiplicative convolution of polynomials which have only non-negative real roots. Moreover, we study the empirical root distributions of limit polynomials obtained through the…

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

We introduce the concept of piecewise interlacing zeros for studying the relation of root distribution of two polynomials. The concept is pregnant with an idea of confirming the real-rootedness of polynomials in a sequence. Roughly…

In this paper, we consider the relationship between the Mahler measure of a polynomial and its separation. In 1964, Mahler proved that if $f(x) \in \mathbb{Z}[x]$ is separable of degree $n$, then $\operatorname{sep}(f) \gg_n M(f)^{-(n-1)}$.…

We study the probability distribution of the number of zeros of multivariable polynomials with bounded degree over a finite field. We find the probability generating function for each set of bounded degree polynomials. In particular, in the…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

We address univariate root isolation when the polynomial's coefficients are in a multiple field extension. We consider a polynomial $F \in L[Y]$, where $L$ is a multiple algebraic extension of $\mathbb{Q}$. We provide aggregate bounds for…

Let $f \in { \mathbb R} ( t) [x]$ be given by $ f(t, x) = x^n + t \cdot g(x) $ and $\beta_1 < \dots < \beta_m$ the distinct real roots of the discriminant $\Delta_{(f, x)} (t)$ of $f(t, x)$ with respect to $x$. Let $\gamma$ be the number of…

The classical Remez inequality bounds the maximum of the absolute value of a polynomial $P(x)$ of degree $d$ on $[-1,1]$ through the maximum of its absolute value on any subset $Z$ of positive measure in $[-1,1]$. Similarly, in several…

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 $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

Working over the split octonions over an algebraically closed field, we solve all polynomial equations in which all the coefficients but the constant term are scalar. As a consequence, we calculate the n-th roots of an octonion.

The degree polynomial of a multigraph $G$ is given by $\sum _{v \in V(G)} x^{\mbox{deg}(v)}$. We investigate here properties of the roots of such polynomials. In addition to examining the roots for some families of graphs with few and many…

We give a criterion for a quasi-ordinary polynomial to be irreducible. The criterion is based on the notion of approximate roots and that of generalized Newton polygons.