Related papers: Zeros of random $P$-polynomials in $\mathbb{C}^d$ …

We show that $0,1$-polynomials of high degree and few terms are irreducible with high probability. Formally, let $k\in\mathbb{N}$ and $F(x)=1+\sum_{i=1}^kx^{n_i}$, where $ 0<n_1<\cdots<n_k\leq N. $ Then we show that…

Let $(\Omega, \mathcal{F}, (\mathcal{F})_{t\ge 0}, P)$ be a complete stochastic basis, $X$ a semimartingale with predictable compensator $(B, C, \nu)$. Consider a family of probability measures $\mathbf{P}=( {P}^{n, \psi}, \psi\in \Psi,…

For $d \geq 2, \ D \geq 1$, let $\mathscr{P}_{d,D}$ denote the set of all degree $d$ polynomials in $D$ dimensions with real coefficients without linear terms. We prove that for any Calder\'{o}n-Zygmund kernel, $K$, the maximally modulated…

In this paper we consider a random entire function of the form $f(z,\omega )=\sum\nolimits_{n=0}^{+\infty}\xi_n(\omega )a_nz^n,$ where $\xi_n(\omega )$ are independent standard\break complex gaussian random variables and $a_n\in\mathbb{C}$…

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…

Potential functions in highly pertinent applications, such as deep learning in over-parameterized regime, are empirically observed to admit non-isolated minima. To understand the convergence behavior of stochastic dynamics in such…

We identify new sufficiency conditions for coercivity of general multivariate polynomials $f\in\mathbb{R}[x]$ which are expressed in terms of their Newton polytopes at infinity and which consist of a system of affine-linear inequalities in…

We establish a generalization of Bourgain double recurrence theorem by proving that for any map $T$ acting on a probability space $(X,\mathcal{A},\mu)$, and for any non-constant polynomials $P, Q$ mapping natural numbers to themselves, for…

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,…

We introduce and study invariants of singularities in positive characteristic called F-thresholds. They give an analogue of the jumping coefficients of multiplier ideals in characteristic zero. We discuss the connection between the…

We study the concentration of a degree-$d$ polynomial of the $N$ spins of a general Ising model, in the regime where single-site Glauber dynamics is contracting. For $d=1$, Gaussian concentration was shown by Marton (1996) and Samson (2000)…

Let P(x) be a one-variable Laurent polynomial of degree (d_1,d_2) over a finite field of characteristic p. For any fixed positive integer s not divisible by p, we prove that the (normalized) p-adic Newton polygon of the L-functions of…

About two decades ago, Tsfasman and Boguslavsky conjectured a formula for the maximum number of common zeros that $r$ linearly independent homogeneous polynomials of degree $d$ in $m+1$ variables with coefficients in a finite field with $q$…

Stationary 1D Schr\"odinger equations with polynomial potentials are reduced to explicit countable closed systems of exact quantization conditions, which are selfconsistent constraints upon the zeros of zeta-regularized spectral…

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

In a recent paper, the first author proved the log-concavity of the coefficients of the characteristic polynomial of a matroid realizable over a field of characteristic 0, answering a long-standing conjecture of Read in graph theory. We…

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…

The probabilistic degree of a Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is defined to be the smallest $d$ such that there is a random polynomial $\mathbf{P}$ of degree at most $d$ that agrees with $f$ at each point with high…

Let \( \{\varphi_i\}_{i=0}^\infty \) be a sequence of orthonormal polynomials on the unit circle with respect to a probability measure \( \mu \). We study zero distribution of random linear combinations of the form \[…

In this article, we study critical points (zeros of derivative) of random polynomials. Take two deterministic sequences $\{a_n\}_{n\geq1}$ and $\{b_n\}_{n\geq1}$ of complex numbers whose limiting empirical measures are same. By choosing…