Related papers: How many zeros of a random sparse polynomial are r…

A novel method with two variations is proposed with which the number of positive and negative zeros of a polynomial with real coefficients and degree $n$ can be restricted with significantly better determinacy than that provided by the…

We establish how the coefficients of a sparse polynomial system influence the sum (or the trace) of its zeros. As an application, we develop numerical tests for verifying whether a set of solutions to a sparse system is complete. These…

We consider a class of real random polynomials, indexed by an integer d, of large degree n and focus on the number of real roots of such random polynomials. The probability that such polynomials have no real root in the interval [0,1]…

We compute the precise leading asymptotics of the variance of the number of real roots for a large class of random polynomials, where the random coefficients have polynomial growth. Our results apply to many classical ensembles, including…

Let n denote the number of variables and m the number of equations in a sparse polynomial system over the binary field. We study the inconsistency probability of randomly generated sparse polynomial systems over the binary field, where each…

Robust mean estimation is one of the most important problems in statistics: given a set of samples in $\mathbb{R}^d$ where an $\alpha$ fraction are drawn from some distribution $D$ and the rest are adversarially corrupted, we aim to…

We study the set $\mathcal{S}$ of odd positive integers $n$ with the property ${2n}/{\sigma(n)} - 1 = 1/x$, for positive integer $x$, i.e., the set that relates to odd perfect and odd "spoof perfect" numbers. As a consequence, we find that…

We consider the rate of convergence of the expected loss of empirically optimal vector quantizers. Earlier results show that the mean-squared expected distortion for any fixed distribution supported on a bounded set and satisfying some…

Lower bounds are given for the number of non-real zeros of a second order linear differential polynomial with constant coefficients in a real entire function with finitely many non-real zeros.

We show how to construct sparse polynomial systems that have non-trivial lower bounds on their numbers of real solutions. These are unmixed systems associated to certain polytopes. For the order polytope of a poset P this lower bound is the…

Suppose that $\langle f_n \rangle$ is a sequence of polynomials, $\langle f_n^{(k)}(0)\rangle$ converges for every non-negative integer $k$, and that the limit is not $0$ for some $k$. It is shown that if all the zeros of $f_1, f_2, \dots$…

Let $ \{\varphi_i(z;\alpha)\}_{i=0}^\infty $, corresponding to $ \alpha\in(-1,1) $, be orthonormal Geronimus polynomials. We study asymptotic behavior of the expected number of real zeros, say $ \mathbb E_n(\alpha) $, of random polynomials…

Let $\{\varphi_k\}_{k=0}^\infty $ be a sequence of orthonormal polynomials on the unit circle (OPUC) with respect to a probability measure $ \mu $. We study the variance of the number of zeros of random linear combinations of the form $$…

Li and Wei (2009) studied the density of zeros of Gaussian harmonic polynomials with independent Gaussian coefficients. They derived a formula for the expected number of zeros of random harmonic polynomials as well as asymptotics for the…

We show that for integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the normal order of the number of prime factors is $C \log \log n$, where $C=(1-e^{-\gamma})^{-1} = 2.280...$ and $\gamma$ is…

A truncation of a Haar distributed orthogonal random matrix gives rise to a matrix whose eigenvalues are either real or complex conjugate pairs, and are supported within the closed unit disk. This is also true for a product $P_m$ of $m$…

There exist homogeneous polynomials $f$ with $\mathbb Q$-coefficients that are sums of squares over $\mathbb R$ but not over $\mathbb Q$. The only systematic construction of such polynomials that is known so far uses as its key ingredient…

Given a set $P$ of $n$ points in $\mathbf{R}^d$, and a positive integer $k \leq n$, the $k$-dispersion problem is that of selecting $k$ of the given points so that the minimum inter-point distance among them is maximized (under Euclidean…

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

For each odd prime $p$, we conjecture the distribution of the $p$-torsion subgroup of $K_{2n}(\mathcal{O}_F)$ as $F$ ranges over real quadratic fields, or over imaginary quadratic fields. We then prove that the average size of the…