English
Related papers

Related papers: Pairing between zeros and critical points of rando…

200 papers

Let $x_1, \dots, x_n$ be $n$ independent and identically distributed random variables with mean zero, unit variance, and finite moments of all remaining orders. We study the random polynomial $p_n$ having roots at $x_1, \dots, x_n$. We…

Probability · Mathematics 2020-05-21 Jeremy G. Hoskins , Stefan Steinerberger

The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…

Combinatorics · Mathematics 2025-11-06 Owen John Levens

It is well known that a random cosine polynomial $ V_n(x) = \sum_ {j=0} ^{n} a_j \cos (j x) , \ x \in (0,2 \pi) $, with the coefficients being independent and identically distributed (i.i.d.) real-valued standard Gaussian random variables…

Probability · Mathematics 2019-08-23 Ali Pirhadi

We consider random systems of equations over the reals, with $m$ equations and $m$ unknowns $P_i(t)+X_i(t)=0$, $t\in\mathbb{R}^m$, $i=1,...,m$, where the $P_i$'s are non-random polynomials having degrees $d_i$'s (the "signal") and the…

Probability · Mathematics 2009-02-09 Diego Armentano , Mario Wschebor

Let $p(x)=a_0 + a_1 x + \ldots + a_n x^n$ be a polynomial with all roots real and satisfying $x \leq -\delta$ for some $0<\delta <1$. We show that for any $0 < \epsilon <1$, the value of $p(1)$ is determined within relative error $\epsilon$…

Combinatorics · Mathematics 2018-06-21 Alexander Barvinok

We study the characteristic polynomial $p_{n}(x)=\prod_{j=1}^{n}(|z_{j}|-x)$ where the $z_{j}$ are drawn from the Mittag-Leffler ensemble, i.e. a two-dimensional determinantal point process which generalizes the Ginibre point process. We…

Mathematical Physics · Physics 2022-05-24 Sung-Soo Byun , Christophe Charlier

We strengthen the Weierstrass approximation theorem by proving that any real-valued continuous function on an interval $I \subset \mathbb{R}$ can be uniformly approximated by a real-valued polynomial whose only (possibly complex) critical…

Classical Analysis and ODEs · Mathematics 2025-01-07 David L. Bishop

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

Algebraic Geometry · Mathematics 2011-11-10 J. Maurice Rojas

We establish a uniform approximation result for the Taylor polynomials of the xi function of Riemann which is valid in the entire complex plane as the degree grows. In particular, we identify a domain growing with the degree of the…

Classical Analysis and ODEs · Mathematics 2016-09-21 Robert Jenkins , Ken D. T. -R. McLaughlin

A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…

Number Theory · Mathematics 2020-11-09 M. J. Uray

We consider random orthonormal polynomials $$ F_{n}(x)=\sum_{i=0}^{n}\xi_{i}p_{i}(x), $$ where $\xi_{0}$, \dots, $\xi_{n}$ are independent random variables with zero mean, unit variance and uniformly bounded $(2+\ep)$ moments, and…

Probability · Mathematics 2023-07-11 Yen Do , Oanh Nguyen , Van Vu

Let $X^N = (X_1^N,\dots, X^N_d)$ be a d-tuple of $N\times N$ independent GUE random matrices and $Z^{NM}$ be any family of deterministic matrices in $\mathbb{M}_N(\mathbb{C})\otimes \mathbb{M}_M(\mathbb{C})$. Let $P$ be a self-adjoint…

Probability · Mathematics 2023-10-25 Benoît Collins , Alice Guionnet , Félix Parraud

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

Rings and Algebras · Mathematics 2025-01-07 Alina G. Goutor

Let $\xi$ be a non-constant real-valued random variable with finite support, and let $M_{n}(\xi)$ denote an $n\times n$ random matrix with entries that are independent copies of $\xi$. For $\xi$ which is not uniform on its support, we show…

Probability · Mathematics 2021-05-07 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli random variables. What can be said about the concentration of $f$ on any single value? This generalises the classical Littlewood--Offord problem,…

Combinatorics · Mathematics 2020-08-11 Matthew Kwan , Lisa Sauermann

Computing the critical points of a polynomial function $q\in\mathbb Q[X_1,\ldots,X_n]$ restricted to the vanishing locus $V\subset\mathbb R^n$ of polynomials $f_1,\ldots, f_p\in\mathbb Q[X_1,\ldots, X_n]$ is of first importance in several…

Symbolic Computation · Computer Science 2014-05-26 Pierre-Jean Spaenlehauer

Let $p(n)$ denote the number of partitions of a natural number $n$. As $ n \to \infty$, the $n$th root of $p(n)$ tends to $1$, which is related to the Cauchy--Hadamard test for power series. Andrews also discovered an elementary proof. Sun…

Combinatorics · Mathematics 2026-01-19 Bernhard Heim und Markus Neuhauser

Let $U\in U(N)$ be a random unitary matrix of size $N$, distributed with respect to the Haar measure on $U(N)$. Let $P(z)=P_U(z)$ be the characteristic polynomial of $U$. We prove that for $z$ close to the unit circle, $ \frac{P'}{P}(z) $…

Number Theory · Mathematics 2024-10-29 Fan Ge

For random polynomials with i.i.d. (independent and identically distribu-ted) zeros following any common probability distribution $\mu$ with support contained in the unit circle, the empirical measures of the zeros of their first and higher…

Complex Variables · Mathematics 2014-09-26 Pak-Leong Cheung , Tuen Wai Ng , Jonathan Tsai , S. C. P. Yam

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