Related papers: Real roots of random polynomials: expectation and …

We study the simultaneous zeros of a random family of $d$ polynomials in $d$ variables over the $p$-adic numbers. For a family of natural models, we obtain an explicit constant for the expected number of zeros that lie in the $d$-fold…

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…

We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…

Let $P(\partial_0,\partial_1,...,\partial_n)$ be a PDO on $\symR^{1+n}$ with constant coefficients. It is proved that (i) the real parts of the $\lambda$-roots of the polynomial $P(\lambda,i\xi_1,...,i\xi_n)$ are bounded from above when…

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

A challenging problem in computational mathematics is to compute roots of a high-degree univariate random polynomial. We combine an efficient multiprecision implementation for solving high-degree random polynomials with two certification…

We introduce a sequence $P_{2n}$ of monic reciprocal polynomials with integer coefficients having the central coefficients fixed. We prove that the ratio between number of nonunimodular roots of $P_{2n}$ and its degree $d$ has a limit when…

We show that detecting real roots for honestly n-variate (n+2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any fixed n. The best previous complexity bounds were exponential in…

In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…

Addressing a problem posed by W. Li and A. Wei (2009), we investigate the average number of (complex) zeros of a random harmonic polynomial $p(z) + \overline{q(z)}$ sampled from the Kac ensemble, i.e., where the coefficients are independent…

Let $p(n)$ denote the number of partitions of a natural number $n$. As $ n \to \infty$, the $n$th root of $p(n)$ tends to $1$, which is related to the Cauchy--Hadamard test for power series. Andrews also discovered an elementary proof. Sun…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

For a field $K$, and a root $\alpha$ of an irreducible polynomial over $K$ (in some algebraic closure) the number of roots of $f(x)$ lying in $K(\alpha)$ is studied here. Given such an $f(x)$ of degree $n$ for which $r$ of the roots are i n…

The classical Erd\H{o}s-Littlewood-Offord problem concerns the random variable $X = a_1 \xi_1 + \dots + a_n \xi_n$, where $a_i \in \mathbb{R} \setminus \{0\}$ are fixed and $\xi_i \sim \text{Ber}(1/2)$ are independent. The…

Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli random variables. What can be said about the concentration of $f$ on any single value? This generalises the classical Littlewood--Offord problem,…

We obtain the asymptotic variance, as the degree goes to infinity, of the normalized number of real roots of a square Kostlan-Shub-Smale random polynomial system of any size. Our main tools are the Kac-Rice formula for the second factorial…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…

It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax…

We consider the zeros of the sum of independent random polynomials as their degrees tend to infinity. Namely, let $p$ and $q$ be two independent random polynomials of degree $n$, whose roots are chosen independently from the probability…

For a given monic integral polynomial $f(x)$ of degree $n$, we define local roots $r_i$ of $f(x)$ for a completely decomposable prime $p$ by $r_i \in \mathbb{Z}$, $f(r_i) \equiv 0 \bmod p$ and $0 \le r_1 \le r_2 \le \dots \le r_n < p$. With…