English
Related papers

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

200 papers

Given a family $(q_k)_k$ of polynomials, we call an open set $U$ root-sparse if the number of zeros of $q_k$ is locally uniformly bounded on $U$. We study the interplay between the individual zeros of the polynomials $q_k$ and those of the…

Complex Variables · Mathematics 2025-01-10 Christian Henriksen , Carsten Lunde Petersen , Eva Uhre

Selecting appropriate regularization coefficients is critical to performance with respect to regularized empirical risk minimization problems. Existing theoretical approaches attempt to determine the coefficients in order for regularized…

Machine Learning · Computer Science 2019-09-05 Akihiro Yabe , Takanori Maehara

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…

Complex Variables · Mathematics 2016-10-11 Andrew Thomack

Let $ \{\varphi_i\}_{i=0}^\infty $ be a sequence of orthonormal polynomials on the unit circle with respect to a positive Borel measure $ \mu $ that is symmetric with respect to conjugation. We study asymptotic behavior of the expected…

Classical Analysis and ODEs · Mathematics 2019-12-02 Hanan Aljubran , Maxim L. Yattselev

We give results on zeros of a polynomial of $\zeta(s),\zeta'(s),\ldots,\zeta^{(k)}(s)$. First, we give a zero free region and prove that there exist zeros corresponding to the trivial zeros of the Riemann zeta function. Next, we estimate…

Number Theory · Mathematics 2018-11-14 Tomokazu Onozuka

Let $\xi_0, \xi_1, \dots$ be i.i.d. random variables with zero mean and unit variance. We study the following four families of random analytic functions: $\sum_{k=0}^n \sqrt{\binom nk} \xi_k z^k$ (spherical polynomials), $\sum_{k=0}^\infty…

Probability · Mathematics 2018-07-05 Hendrik Flasche , Zakhar Kabluchko

Let $T>0$ and consider the random Dirichlet polynomial $S_T(t)=Re\, \sum_{n\leq T} X_n n^{-1/2-it}$, where $(X_n)_{n}$ are i.i.d. Gaussian random variables with mean $0$ and variance $1$. We prove that the expected number of roots of…

Number Theory · Mathematics 2025-04-24 Marco Aymone , Caio Bueno

It has been shown that zeros of Kac polynomials $K_n(z)$ of degree $n$ cluster asymptotically near the unit circle as $n\to\infty$ under some assumptions. This property remains unchanged for the $l$-th derivative of the Kac polynomials…

Probability · Mathematics 2019-08-05 Renjie Feng , Dong Yao

We show that with high probability the number of real zeroes of a random polynomial is bounded by the number of vertices on its Newton-Hadamard polygon times the cube of the logarithm of the polynomial degree. A similar estimate holds for…

Probability · Mathematics 2016-01-20 Ken Söze

For a $t$-nomial $f(x) = \sum_{i = 1}^t c_i x^{a_i} \in \mathbb{F}_q[x]$, we show that the number of distinct, nonzero roots of $f$ is bounded above by $2 (q-1)^{1-\varepsilon} C^\varepsilon$, where $\varepsilon = 1/(t-1)$ and $C$ is the…

Number Theory · Mathematics 2019-02-20 Zander Kelley

Let $\{\eta_{j}\}_{j = 0}^{N}$ be a sequence of independent, identically distributed random complex Gaussian variables, and let $\{f_{j} (z)\}_{j = 0}^{N}$ be a sequence of given analytic functions that are real-valued on the real number…

Probability · Mathematics 2019-10-14 Christopher Corley , Andrew Ledoan

We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. We show: * An O(k log n)-time randomized algorithm for the case where the input signal has at most k non-zero…

Data Structures and Algorithms · Computer Science 2012-04-09 Haitham Hassanieh , Piotr Indyk , Dina Katabi , Eric Price

The Newton polytope $P_f$ of a polynomial $f$ is well known to have a strong impact on its zeros, as in the Kouchnirenko-Bernstein theorem on the number of simultaneous zeros of $m$ polynomials with given Newton polytopes. In this article,…

Algebraic Geometry · Mathematics 2007-05-23 Bernard Shiffman , Steve Zelditch

We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials,…

Combinatorics · Mathematics 2010-08-17 Lily L. Liu , Yi Wang

Our interest lies in describing the zero behaviour of Gauss hypergeometric polynomials $F(-n,b; c; z)$ where $b$ and $c$ are arbitrary parameters. In general, this problem has not been solved and even when $b$ and $c$ are both real, the…

Classical Analysis and ODEs · Mathematics 2008-12-04 K Driver , K Jordaan

We consider ensembles of random polynomials of the form $p(z)=\sum_{j = 1}^N a_j P_j$ where $\{a_j\}$ are independent complex normal random variables and where $\{P_j\}$ are the orthonormal polynomials on the boundary of a bounded simply…

Complex Variables · Mathematics 2007-05-23 Bernard Shiffman , Steve Zelditch

We study the number of real zeros of trigonometric polynomials in a period and the number of zeros of self-reciprocal algebraic polynomials on the unit circle under the assumption that their coefficients are in a fixed finite set of real…

Classical Analysis and ODEs · Mathematics 2016-02-09 Tamas Erdelyi

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

Data Structures and Algorithms · Computer Science 2015-04-08 Ishay Haviv , Oded Regev

According to the real \tau-conjecture, the number of real roots of a sum of products of sparse polynomials should be polynomially bounded in the size of such an expression. It is known that this conjecture implies a superpolynomial lower…

Computational Complexity · Computer Science 2014-05-19 Pascal Koiran , Natacha Portier , Sébastien Tavenas

In this paper, we study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is either an arc,…

Complex Variables · Mathematics 2018-06-08 David G. L. Wang , Jerry J. R. Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›