English
Related papers

Related papers: Real Roots of Random Polynomials and Zero Crossing…

200 papers

We improve the local generic position method for isolating the real roots of a zero-dimensional bivariate polynomial system with two polynomials and extend the method to general zero-dimensional polynomial systems. The method mainly…

Symbolic Computation · Computer Science 2013-12-03 Jin-San Cheng , Kai Jin

Let $Q_n(x)=\sum_{i=0}^{n} A_{i}x^{i}$ be a random polynomial where the coefficients $A_0,A_1,... $ form a sequence of centered Gaussian random variables. Moreover, assume that the increments $\Delta_j=A_j-A_{j-1}$, $j=0,1,2,...$ are…

Probability · Mathematics 2007-06-13 S. Rezakhah , S. Shemehsavar

The Fundamental Theorem of Algebra (FTA) asserts that every complex polynomial has as many complex roots, counted with multiplicities, as its degree. A probabilistic analogue of this theorem for real roots of real polynomials, sometimes…

Algebraic Geometry · Mathematics 2026-02-23 Boris Kazarnovskii

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

Classical Analysis and ODEs · Mathematics 2022-04-12 Reuben Wheeler

We consider the sequence of polynomials $W_n(x)$ defined by the recursion $W_n(x)=(ax+b)W_{n-1}(x)+dW_{n-2}(x)$, with initial values $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a,b,d,t,r$ are real numbers, $a,t>0$, and $d<0$. We show that every…

Classical Analysis and ODEs · Mathematics 2015-03-19 J. L. Gross , T. Mansour , T. W. Tucker , D. G. L. Wang

For a tree Markov random field non-reconstruction is said to hold if as the depth of the tree goes to infinity the information that a typical configuration at the leaves gives about the value at the root goes to zero. The distribution of…

Discrete Mathematics · Computer Science 2011-07-28 Nayantara Bhatnagar , Elitza Maneva

We study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear and quadratic polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is the closure of…

Classical Analysis and ODEs · Mathematics 2020-03-02 David G. L. Wang , Jerry J. R. Zhang

Hayes equivalence is defined on monic polynomials over a finite field $\fq$ in terms of the prescribed leading coefficients and the residue classes modulo a given monic polynomial $Q$. We study the distribution of the number of zeros in a…

Combinatorics · Mathematics 2024-01-09 Zhicheng Gao

In this paper we propose a model of random compositions of cylinder maps, which in the simplified form is as follows: let $(\theta,r)\in \mathbb T\times \mathbb R=\mathbb A$ and \[ f_{\pm 1}:…

Dynamical Systems · Mathematics 2017-05-29 Oriol Castejón , Marcel Guardia , Vadim Kaloshin

We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a novel way to compute a lower bound on the positive real…

Symbolic Computation · Computer Science 2011-04-27 Elias Tsigaridas

We study the zero distribution of non-orthogonal polynomials attached to $g(n)=s(n)=n^2$: \begin{equation*} Q_n^g(x)= x \sum_{k=1}^n g(k) \, Q_{n-k}^g(x), \quad Q_0^g(x):=1. \end{equation*} It is known that the case $g=id$ involves…

Classical Analysis and ODEs · Mathematics 2021-07-13 Bernhard Heim , Markus Neuhauser

The question about the behavior of gaps between zeros of polynomials under differentiation is classical and goes back to Marcel Riesz. In this paper, we analyze a nonlocal nonlinear partial differential equation formally derived by Stefan…

Analysis of PDEs · Mathematics 2020-12-17 Alexander Kiselev , Changhui Tan

The study of Markov processes and broadcasting on trees has deep connections to a variety of areas including statistical physics, graphical models, phylogenetic reconstruction, Markov Chain Monte Carlo, and community detection in random…

Probability · Mathematics 2022-10-26 Frederic Koehler , Elchanan Mossel

We study the expected number of real zeros for random linear combinations of orthogonal polynomials. It is well known that Kac polynomials, spanned by monomials with i.i.d. Gaussian coefficients, have only $(2/\pi + o(1))\log{n}$ expected…

Probability · Mathematics 2015-07-07 Doron S. Lubinsky , Igor E. Pritsker , Xiaoju Xie

In this paper we consider the distribution of the zeros of a real random Bargmann-Fock function of one or more variables. For these random functions we prove estimates for two types of families of events, both of which are large deviations…

Complex Variables · Mathematics 2008-07-04 Scott Zrebiec

Let $f = \sum_{k=0}^n \varepsilon_k z^k$ be a random polynomial, where $\varepsilon_0,\ldots ,\varepsilon_n$ are iid standard Gaussian random variables, and let $\zeta_1,\ldots,\zeta_n$ denote the roots of $f$. We show that the point…

Probability · Mathematics 2020-10-22 Marcus Michelen , Julian Sahasrabudhe

We study the evolution of the roots of a polynomial of degree $N$, when the polynomial itself is evolving according to the heat flow. We propose a general conjecture for the large-$N$ limit of this evolution. Specifically, we propose (1)…

Probability · Mathematics 2025-08-19 Brian C. Hall , Ching-Wei Ho

We obtain a Central Limit Theorem for the normalized number of real roots of a square Kostlan-Shub-Smale random polynomial system of any size as the degree goes to infinity. A study of the asymptotic variance of the number of roots is…

Probability · Mathematics 2018-05-07 Diego Armentano , Jean-Marc Azaïs , Federico Dalmao , José León

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

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

Numerical Analysis · Mathematics 2014-07-01 Victor Y. Pan
‹ Prev 1 4 5 6 7 8 10 Next ›