English
Related papers

Related papers: Pairing of Zeros and Critical Points for Random Po…

200 papers

Sequences of discrete random variables are studied whose probability generating functions are zero-free in a sector of the complex plane around the positive real axis. Sharp bounds on the cumulants of all orders are stated, leading to…

Probability · Mathematics 2023-12-04 Nils Heerten , Holger Sambale , Christoph Thäle

We show that if m is a probability measure with infinite support on the unit circle having no singular component and a differentiable weight, then the corresponding paraorthogonal polynomial P_n(z;B) solves an explicit second order linear…

Classical Analysis and ODEs · Mathematics 2021-08-11 Brian Simanek

We consider polynomials on the unit circle defined by the recurrence relation \Phi_{k+1}(z) = z \Phi_{k} (z) - \bar{\alpha}_{k} \Phi_k^{*}(z) for k \geq 0 and \Phi_0=1. For each n we take \alpha_0, \alpha_1, ...,\alpha_{n-2} i.i.d. random…

Mathematical Physics · Physics 2007-05-23 Mihai Stoiciu

We study the property of hitting points for a class of $\mathbb{R}^d$-valued continuous Gaussian random fields on $\mathbb{R}^N$ with stationary increments, i.i.d. coordinates, and a regularly varying variance function $\sigma$ of index…

Probability · Mathematics 2026-04-10 Youssef Hakiki , Cheuk Yin Lee , Yimin Xiao

We study the asymptotic distribution of zeros for the random polynomials $P_n(z) = \sum_{k=0}^n A_k B_k(z)$, where $\{A_k\}_{k=0}^{\infty}$ are non-trivial i.i.d. complex random variables. Polynomials $\{B_k\}_{k=0}^{\infty}$ are…

Complex Variables · Mathematics 2016-07-12 Igor Pritsker , Koushik Ramachandran

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

Mathematical Physics · Physics 2017-06-13 Francesco Calogero , Francois Leyvraz

Let $p_n(x)$ be orthogonal polynomials associated to a measure $d\mu$ of compact support in $R$. If $E\not\in supp(d\mu)$, we show there is a $\delta>0$ so that for all $n$, either $p_n$ or $p_{n+1}$ has no zeros in $(E-\delta, E+\delta)$.…

Classical Analysis and ODEs · Mathematics 2007-05-23 Sergey A. Denisov , Barry Simon

Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp…

Number Theory · Mathematics 2014-02-26 Andreas Strömbergsson

In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices in linear algebra or the polynomials with multiple roots for…

Algebraic Geometry · Mathematics 2019-07-19 Joachim von zur Gathen , Guillermo Matera

Let $X_1,X_2,...,X_n$ be a sequence of independent or locally dependent random variables taking values in $\mathbb{Z}_+$. In this paper, we derive sharp bounds, via a new probabilistic method, for the total variation distance between the…

Statistics Theory · Mathematics 2010-10-11 Michael V. Boutsikas , Eutichia Vaggelatou

Given $n$ independent random marked $d$-vectors $X_i$ with a common density, define the measure $\nu_n = \sum_i \xi_i $, where $\xi_i$ is a measure (not necessarily a point measure) determined by the (suitably rescaled) set of points near…

Probability · Mathematics 2007-05-23 Mathew D. Penrose

We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1. The least nonnegative solution, say mu, of such equation systems is…

Data Structures and Algorithms · Computer Science 2010-02-03 Javier Esparza , Andreas Gaiser , Stefan Kiefer

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…

Data Structures and Algorithms · Computer Science 2009-02-10 Mahdi Cheraghchi , Amin Shokrollahi

We derive a tight upper bound on the probability over $\mathbf{x}=(x_1,\dots,x_\mu) \in \mathbb{Z}^\mu$ uniformly distributed in $ [0,m)^\mu$ that $f(\mathbf{x}) = 0 \bmod N$ for any $\mu$-linear polynomial $f \in…

Discrete Mathematics · Computer Science 2022-05-06 Benedikt Bünz , Ben Fisch

Let $X$ be a locally compact Polish space. A random measure on $X$ is a probability measure on the space of all (nonnegative) Radon measures on $X$. Denote by $\mathbb K(X)$ the cone of all Radon measures $\eta$ on $X$ which are of the form…

Probability · Mathematics 2015-03-17 Yuri Kondratiev , Tobias Kuna , Eugene Lytvynov

We study the correlation between the total number of critical points of random spherical harmonics and the number of critical points with value in any interval $I \subset \mathbb{R}$. We show that the correlation is asymptotically zero,…

Probability · Mathematics 2021-10-22 Valentina Cammarota , Anna Paola Todino

Let S be a finite subset of a field. For multivariate polynomials the generalized Schwartz-Zippel bound [2], [4] estimates the number of zeros over Sx...xS counted with multiplicity. It does this in terms of the total degree, the number of…

Number Theory · Mathematics 2010-01-05 Olav Geil , Casper Thomsen

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

Classical Analysis and ODEs · Mathematics 2019-08-07 Aaron M. Yeager

Principal points were first introduced by Flury: for a positive integer $n$, $n$ principal points of a random variable are the $n$ points that minimize the mean squared distance between the random variable and the nearest of the $n$ points.…

Probability · Mathematics 2018-07-31 Santanu Chakraborty , Mrinal Kanti Roychowdhury , Josef Sifuentes

We investigate a dynamical basis for the Riemann hypothesis (RH) that the non-trivial zeros of the Riemann zeta function lie on the critical line x = 1/2. In the process we graphically explore, in as rich a way as possible, the diversity of…

Complex Variables · Mathematics 2011-10-26 Chris King