Related papers: Random polynomials having few or no real zeros

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

By random complex zeroes we mean the zero set of a random entire function whose Taylor coefficients are independent complex-valued Gaussian variables, and the variance of the k-th coefficient is 1/k!. This zero set is distribution invariant…

We provide explicit conditions for a real polynomial $f$ of degree 2d to be a sum of squares (s.o.s.), stated only in terms of the coefficients of $f$, i.e. with no lifting. All conditions are simple and provide an explicit description of a…

Given a polynomial $g$ of positive degree over a finite field, we show that the proportion of polynomials of degree $n$, which can be written as $h+g^k$, where $h$ is an irreducible polynomial of degree $n$ and $k$ is a nonnegative integer,…

We find the constant $b_{\infty}$ ($b_{\infty} \approx 4.81058280$) such that if a complex polynomial or entire function $f(z) = \sum_{k=0}^ \omega a_k z^k, $ $\omega \in \{2, 3, 4, \ldots \} \cup \{\infty\},$ with nonzero coefficients…

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…

We investigate average gradient degree of normal random polynomials of fixed algebraic degree n. In particular, for polynomials of two variables, asymptotics of the average gradient degree for large values of n is determined.

Oberchkoff's inequality says that a polynomial of degree d with non-negative coefficients has at most 2ad/pi zeros in the angle {|arg z|<a}. We improve and generalize this inequality, and study the case of equality.

We present a theory of the $b$-function (or Bernstein-Sato polynomial) in positive characteristic. Let $f$ be a non-constant polynomial with coefficients in a perfect field $k$ of characteristic $p>0.$ Its $b$-function $b_f$ is defined to…

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

This paper investigates the zero distribution of a sequence of polynomials $\left\{ P_{m}(z)\right\} _{m=0}^{\infty}$ generated by the reciprocal of $1+ct+B(z)t^{2}+A(z)t^{3}$ where $c\in\mathbb{R}$ and $A(z)$, $B(z)$ are real linear…

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

We prove that there is an absolute constant $c > 0$ such that every polynomial $P$ of the form $$P(z) = \sum_{j=0}^{n}{a_jz^j}\,, \quad |a_0| = 1\,, \quad |a_j| \leq M\,, \quad a_j \in \Bbb{C}\,, \quad M \geq 1\,,$$ has at most…

We characterize the polynomials $p_1(t), ... , p_n(t)$ whose Wronskian $W(p_1, ... , p_n)$ is a nonzero constant. Then, we generalize our results to characterize the Laurent polynomials with the same property. Finally, for rational…

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

Given a probability measure $\mu$ with infinite support on the unit circle $\partial\mathbb{D}=\{z:|z|=1\}$, we consider a sequence of paraorthogonal polynomials $\h_n(z,\lambda)$ vanishing at $z=\lambda$ where $\lambda \in \T$ is fixed. We…

We consider random trigonometric polynomials of the form \[ f_n(t):=\sum_{1\le k \le n} a_{k} \cos(kt) + b_{k} \sin(kt), \] whose entries $(a_{k})_{k\ge 1}$ and $(b_{k})_{k\ge 1}$ are given by two independent stationary Gaussian processes…

A complex harmonic polynomial is the sum of a complex polynomial and a conjugated complex polynomial, of degrees $n$ and $m$ respectively. Li and Wei (2009) presented a formula for the expected number of zeros of a random harmonic…