Related papers: Pairing between zeros and critical points of rando…

Let $\P_{n}^c(\bar{\mu},\bar{\nu})$ be the set of all complex polynomials $p(z)=\prod_{i=1}^{m}(z-z_i)^{\mu_i}$, $\sum_{i=1}^m\mu_i=n$, with derivatives of the form $$ p'(z)=n\prod_{i=1}^{m}(z-z_i)^{\mu_i-1}\prod_{j=1}^{k}(z-\xi_j)^{\nu_j},…

We study the asymptotic distribution of critical values of random holomorphic `polynomials' s_n on a Kaehler manifold M as the degree n tends to infinity. By `polynomial' of degree n we mean a holomorphic section of the nth power of a…

If $p:\mathbb{C} \to \mathbb{C}$ is a non-constant polynomial, the Gauss--Lucas theorem asserts that its critical points are contained in the convex hull of its roots. We consider the case when $p$ is a random polynomial of degree $n$ with…

For each $\alpha \in (0, 1)$, we construct a bounded monotone deterministic sequence $(c_k)_{k \geq 0}$ of real numbers so that the number of real roots of the random polynomial $f_n(z) = \sum_{k=0}^n c_k \varepsilon_k z^k$ is $n^{\alpha +…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Let $P_n(x) = \sum_{k=0}^{n} \xi_k x^k$ be a Kac random polynomial, where the coefficients $\xi_k$ are i.i.d.\ copies of a given random variable $\xi$. Based on numerical experiments, it has been conjectured that if $\xi$ has mean zero,…

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…

We consider random orthonormal polynomials $$ P_{n}(x)=\sum_{i=0}^{n}\xi_{i}p_{i}(x), $$ where $\xi_{0}$, . . . , $\xi_{n}$ are independent random variables with zero mean, unit variance and uniformly bounded $(2+\ep_0)$-moments, and…

We consider random polynomials whose coefficients are independent and identically distributed on the integers. We prove that if the coefficient distribution has bounded support and its probability to take any particular value is at most…

We study the asymptotic distribution of zeros for the random polynomials $P_n(z) = \sum_{k=0}^n A_k B_k(z)$, where $\{A_k\}_{k=0}^{\infty}$ are non-trivial i.i.d. complex random variables. Polynomials $\{B_k\}_{k=0}^{\infty}$ are…

We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…

Consider a random polynomial $$ G_Q(x)=\xi_{Q,n}x^n+\xi_{Q,n-1}x^{n-1}+...+\xi_{Q,0} $$ with independent coefficients uniformly distributed on $2Q+1$ integer points $\{-Q, ..., Q\}$. Denote by $D(G_Q)$ the discriminant of $G_Q$. We show…

We consider random polynomials whose coefficients are independent and uniform on {-1,1}. We prove that the probability that such a polynomial of degree n has a double root is o(n^{-2}) when n+1 is not divisible by 4 and asymptotic to…

A result of Hoskins and Steinerberger [Int. Math. Res. Not., (13):9784-9809, 2022] states that repeatedly differentiating a random polynomials with independent and identically distributed mean zero and variance one roots will result, after…

We consider random polynomials of the form $H_n(z)=\sum_{j=0}^n\xi_jq_j(z)$ where the $\{\xi_j\}$ are i.i.d non-degenerate complex random variables, and the $\{q_j(z)\}$ are orthonormal polynomials with respect to a compactly supported…

Let $\mu$ and $\nu$ be probability measures in the complex plane, and let $p$ and $q$ be independent random polynomials of degree $n$, whose roots are chosen independently from $\mu$ and $\nu$, respectively. Under assumptions on the…

We consider random polynomials $p_n(x)=\xi_0+\xi_1+\dots+\xi_n x^n$ whose coefficients are independent and identically distributed with zero mean, unit variance, and bounded $(2+\epsilon)^{th}$ moment (for some $\epsilon>0$), also known as…

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…

We consider the set S(n,0) of monic complex polynomials of degree $n\ge 2$ having all their zeros in the closed unit disk and vanishing at 0. For $p\in S(n,0)$ we let $|p|_{0}$ denote the distance from the origin to the zero set of $p'$. We…

Let $f = \sum_{k=0}^n \varepsilon_k z^k$ be a random polynomial, where $\varepsilon_0,\ldots ,\varepsilon_n$ are iid standard Gaussian random variables, and let $\zeta_1,\ldots,\zeta_n$ denote the roots of $f$. We show that the point…