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

In a recent paper, Bary-Soroker, Koukoulopoulos and Kozma proved that when $A$ is a random monic polynomial of $\mathbb{Z}[X]$ of deterministic degree $n$ with coefficients $a_j$ drawn independently according to measures $\mu_j,$ then $A$…

Wang and Yeh proved that if $P(x)$ is a polynomial with nonnegative and nondecreasing coefficients, then $P(x+d)$ is unimodal for any $d>0$. A mode of a unimodal polynomial $f(x)=a_0+a_1x+\cdots + a_mx^m$ is an index $k$ such that $a_k$ is…

Upper bounds for the probabilities $\mathbb{P}(F\geq \mathbb{E} F + r)$ and $\mathbb{P}(F\leq \mathbb{E} F - r)$ are proved, where $F$ is a certain component count associated with a random geometric graph built over a Poisson point process…

Non-separable $D-$dimensional partial differential Schr\"{o}dinger equations are considered at $D=2$ and $D=3$, with the even-parity local potentials $V(x,y,\ldots)$ which are polynomials of degree four (cusp catastrophe resembling case)…

For $G$ an open set in $\mathbb{C}$ and $W$ a non-vanishing holomorphic function in $G$, in the late 1990's, Pritsker and Varga characterized pairs $(G,W)$ having the property that any $f$ holomorphic in $G$ can be locally uniformly…

We begin with the observation, based on previous results, that dimension-free lower bounds on the variance of a polynomial under a log-concave measure yield dimension-free small-ball and Fourier decay estimates. Motivated by this, we…

One question that we investigate in this paper is, how can we build log-concave polynomials using sparse polynomials as building blocks? More precisely, let $f = \sum\_{i = 0}^d a\_i X^i \in \mathbb{R}^+[X]$ be a polynomial satisfying the…

Let $f$ be a polynomial automorphism of ${\Bbb C}^k$ of degree $\lambda$, whose rational extension to ${\Bbb P}^k$ maps the hyperplane at infinity to a single point. Given any positive closed current $S$ on ${\Bbb P}^k$ of bidegree (1,1),…

We study the limiting behavior of the zeros of the Euler polynomials. When linearly scaled, they approach a definite curve in the complex plane related to the Szego curve which governs the behavior of the roots of the Taylor polynomials…

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Let $X$ be a normal projective variety of dimension $d$, and let $f$ be a zero-entropy automorphism of $X$. Denote by $k$ the first-degree growth rate of $f$, so that $\deg_1(f^n) \asymp n^{k}$. We prove the sharp lower bound for the…

Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…

For a fixed prime power $q$ and natural number $d$ we consider a random polynomial $$f=x^n+a_{n-1}(t)x^{n-1}+\ldots+a_1(t)x+a_0(t)\in\mathbb F_q[t][x]$$ with $a_i$ drawn uniformly and independently at random from the set of all polynomials…

We prove combinatorial rigidity of infinitely renormalizable unicritical polynomials, P_c :z \mapsto z^d+c, with complex c, under the a priori bounds and a certain "combinatorial condition". This implies the local connectivity of the…

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…

For any $A(z),B(z),C(z)\in\mathbb{C}[z]$, we study the zero distribution of a table of polynomials $\left\{ P_{m,n}(z)\right\} _{m,n\in\mathbb{N}_{0}}$ satisfying the recurrence relation \[…

Consider the random polytope, that is given by the convex hull of a Poisson point process on a smooth convex body in $\mathbb{R}^d$. We prove central limit theorems for continuous motion invariant valuations including the Will's functional…

We show that for multivariate Freud-type weights $W_\alpha(x)=\exp(-|x|^\alpha)$, $\alpha>1$, any convex function $f$ on $R^d$ satisfying $fW_\alpha\in L_p(R^d)$ if $1\le p<\infty$, or $\lim_{|x|\to\infty}f(x)W_\alpha(x)=0$ if $p=\infty$,…

We present a new data structure to approximate accurately and efficiently a polynomial $f$ of degree $d$ given as a list of coefficients. Its properties allow us to improve the state-of-the-art bounds on the bit complexity for the problems…

We are concerned with zeros of random power series with coefficients being a stationary, centered, complex Gaussian process. We show that the expected number of zeros in every smooth domain in the disk of convergence is less than that of…