English
Related papers

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

200 papers

Let $f$ be a Gaussian random field on $\mathbb{R}^d$ and let $X$ be the number of critical points of $f$ contained in a compact subset. A long-standing conjecture is that, under mild regularity and non-degeneracy conditions on $f$, the…

Probability · Mathematics 2023-07-21 Louis Gass , Michele Stecconi

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena

In the setting where we have $n$ independent observations of a random variable $X$, we derive explicit error bounds in total variation distance when approximating the number of observations equal to the maximum of the sample (in the case…

Probability · Mathematics 2026-04-10 Fraser Daly

Let \( \{\varphi_i\}_{i=0}^\infty \) be a sequence of orthonormal polynomials on the unit circle with respect to a probability measure \( \mu \). We study zero distribution of random linear combinations of the form \[…

Classical Analysis and ODEs · Mathematics 2019-12-02 Maxim L. Yattselev , Aaron Yeager

Consider a system $f_1(x)=0,\ldots,f_n(x)=0$ of $n$ random real polynomials in $n$ variables, where each $f_i$ has a prescribed set of exponent vectors described by a set $A_i \subseteq \mathbb{Z}^n$ of cardinality $t_i$, whose convex hull…

Probability · Mathematics 2023-06-05 Peter Bürgisser

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

We consider the zeros of the sum of independent random polynomials as their degrees tend to infinity. Namely, let $p$ and $q$ be two independent random polynomials of degree $n$, whose roots are chosen independently from the probability…

Probability · Mathematics 2020-10-12 Sean O'Rourke , Tulasi Ram Reddy

In this note we obtain lower bounds for $\P(\xi\geq 0)$ and $\P(\xi>0)$ under assumptions on the moments of a centered random variable $\xi$. The obtained estimates are shown to be optimal and improve results from the literature. The…

Probability · Mathematics 2008-04-24 Mark Veraar

We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…

Classical Analysis and ODEs · Mathematics 2016-09-07 Ilia Krasikov

We extend a theorem of Herman from the case of unicritical polynomials to the case of polynomials with two finite critical values. This theorem states that Siegel disks of such polynomials, under a diophantine condition (called Herman's…

Dynamical Systems · Mathematics 2016-03-15 Arnaud Chéritat , Pascale Roesch

The effect that weighted summands have on each other in approximations of $S=w_1S_1+w_2S_2+\cdots+w_NS_N$ is investigated. Here, $S_i$'s are sums of integer-valued random variables, and $w_i$ denote weights, $i=1,\dots,N$. Two cases are…

Probability · Mathematics 2018-06-12 Vydas Čekanavičius , Palaniappan Vellaisamy

Given a polynomial system f associated with a simple multiple zero x of multiplicity {\mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited…

Numerical Analysis · Mathematics 2017-03-14 Zhiwei Hao , Wenrong Jiang , Nan Li , Lihong Zhi

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

The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…

Computational Complexity · Computer Science 2012-10-05 Bruno Grenet , Pascal Koiran , Natacha Portier

Form an $n \times n$ matrix by drawing entries independently from $\{\pm1\}$ (or another fixed nontrivial finitely supported distribution in $\mathbf{Z}$) and let $\phi$ be the characteristic polynomial. Conditionally on the extended…

Number Theory · Mathematics 2022-03-16 Sean Eberhard

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 $X_N$ be a random trigonometric polynomial of degree $N$ with iid coefficients and let $Z_N(I)$ denote the (random) number of its zeros lying in the compact interval $I\subset\mathbb{R}$. Recently, a number of important advances were…

Probability · Mathematics 2015-12-18 Jean-Marc Azaïs , Federico Dalmao , José León , Ivan Nourdin , Guillaume Poly

A result of Hoskins and Steinerberger [Int. Math. Res. Not., (13):9784-9809, 2022] states that repeatedly differentiating a random polynomials with independent and identically distributed mean zero and variance one roots will result, after…

Probability · Mathematics 2025-07-30 Octavio Arizmendi , Andrew Campbell , Katsunori Fujie

We analyze metrics for how close an entire function of genus one is to being real rooted. These metrics arise from truncated Hankel matrix positivity-type conditions built from power series coefficients at each real point. Specifically, if…

Complex Variables · Mathematics 2021-08-11 Kelly Bickel , J. E. Pascoe , Meredith Sargent

We prove an LDP for the empirical measure of complex zeros of a Gaussian random complex polynomial of degree N of one variable as N tends to infinity. The Gaussian measure is induced by an inner product defined by a smooth weight (Hermitian…

Probability · Mathematics 2011-01-04 O. Zeitouni , S. Zelditch