Related papers: Roots of random polynomials with coefficients havi…

We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the…

A real univariate polynomial with all roots real is called hyperbolic. By Descartes' rule of signs for hyperbolic polynomials (HPs) with all coefficients nonvanishing, a HP with $c$ sign changes and $p$ sign preservations in the sequence of…

In this paper we prove Hasse local-global principle for polynomials with coefficients in Mordell-Weil type groups over number fields like S-units, abelian varieties with trivial ring of endomorphisms and odd algebraic K-theory groups.

We develop a unified approach to universality of local scaling limits for eigenvalues of random normal matrices, or equivalently for planar Coulomb gases at inverse temperature $\beta=2$. The approach is direct in that it does not rely on…

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…

In this article we use a method of finding the index of a complex-valued function by determined number of arithmetic operations to describe an algorithm of localization of roots of square-free polynomials. We give an estimation of the…

The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

This is a straightforward introduction to the properties of polynomials in many variables that do not vanish in the open upper half plane. Such polynomials generalize many of the well-known properties of polynomials with all real roots.

This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…

We give sufficient conditions for the uniform hyperbolicity of certain nonuniformly hyperbolic dynamical systems. In particular, we show that local diffeomorphisms that are nonuniformly expanding on sets of total probability are necessarily…

In this paper we study universal quadratic polynomials which arise as sums of polygonal numbers. Specifically, we determine an asymptotic upper bound (as a function of $m$) on the size of the set $S_m\subset\mathbb{N}$ such that if a sum of…

We consider the number of roots of linear combinations of a system of $n$ orthogonal eigenfunctions of a Sturm-Liouville initial value problem with i.i.d. standard Gaussian coefficients. We prove that its distribution inherits the…

We obtain new partial results supporting the spectral set conjecture in dimension 1.

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

Let $X_N$ be a random trigonometric polynomial of degree $N$ with iid coefficients and let $Z_N(I)$ denote the (random) number of its zeros lying in the compact interval $I\subset\mathbb{R}$. Recently, a number of important advances were…

We study the regularity of the roots of complex monic polynomials $P(t)$ of fixed degree depending smoothly on a real parameter $t$. We prove that each continuous parameterization of the roots of a generic $C^\infty$ curve $P(t)$ (which…

Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots…

We study the number of real roots of a Kostlan random polynomial of degree $d$ in one variable. More generally, we are interested in the distribution of the counting measure of the set of real roots of such a polynomial. We compute the…