English
Related papers

Related papers: Random polynomials and expected complexity of bise…

200 papers

We examine several of the normal-form multivariate polynomial rootfinding methods of Telen, Mourrain, and Van Barel and some variants of those methods. We analyze the performance of these variants in terms of their asymptotic temporal…

We investigate the probability that a random polynomial with independent, mean-zero and finite variance coefficients has no real zeros. Specifically, we consider a random polynomial of degree $2n$ with coefficients given by an i.i.d.…

Probability · Mathematics 2024-10-29 Promit Ghosal , Sumit Mukherjee

We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…

Complex Variables · Mathematics 2024-01-29 Turgay Bayraktar , Tom Bloom , Norm Levenberg

In this work we consider a given root of a family of n-degree polynomials as a one-variable function that depends only on the independent term. Then we prove that this function satisfies several ordinary differential equations (ODE). More…

Classical Analysis and ODEs · Mathematics 2020-06-17 Armengol Gasull , Hector Giacomini

The Waring Problem over polynomial rings asks for how to decompose an homogeneous polynomial of degree $d$ as a finite sum of $d^{th}$ powers of linear forms. First, we give a constructive method to obtain a real Waring decomposition of any…

Algebraic Geometry · Mathematics 2018-07-11 Macarena Ansola , Antonio Díaz-Cano , M. Angeles Zurro

In this paper, we consider nonlocal, nonlinear partial differential equations to model anisotropic dynamics of complex root sets of random polynomials under differentiation. These equations aim to generalise the recent PDE obtained by…

Numerical Analysis · Mathematics 2022-05-19 André Galligo

The large degree asymptotics of the expected number of real zeros of a random trigonometric polynomial $$ T_n(x) = \sum_ {j=0} ^{n} a_j \cos (j x) + b_j \sin (j x), \ x \in (0,2\pi), $$ with i.i.d. real-valued standard Gaussian coefficients…

Probability · Mathematics 2021-11-01 Ali Pirhadi

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

For dispersive Hamiltonian partial differential equations of order 2N+1, N integer, there are two criteria to analyse to examine the stability of small-amplitude, periodic travelling wave solutions to high-frequency perturbations. The first…

Analysis of PDEs · Mathematics 2019-06-12 Olga Trichtchenko

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

Numerical Analysis · Mathematics 2023-09-18 Bor Plestenjak , Michiel E. Hochstenbach

Univariate polynomials with only real roots -- while special -- do occur often enough that their properties can lead to interesting conclusions in diverse areas. Due mainly to the recent work of two young mathematicians, Julius Borcea and…

Complex Variables · Mathematics 2009-11-19 David G. Wagner

We consider sequences of random variables whose probability generating functions are polynomials all of whose roots lie on the unit circle. The distribution of such random variables has only been sporadically studied in the literature. We…

Probability · Mathematics 2013-01-11 Hsien-Kuei Hwang , Vytas Zacharovas

The classical Erd\H{o}s-Tur\'an inequality on the distribution of roots for complex polynomials can be equivalently stated in a potential theoretic formulation, that is, if the logarithmic potential generated by a probability measure on the…

Classical Analysis and ODEs · Mathematics 2021-10-08 Ruiwen Shu , Jiuya Wang

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Kenneth Ward

We specify a small set, consisting of $O(d(\log\log d)^2)$ points, that intersects the basins under Newton's method of \emph{all} roots of \emph{all} (suitably normalized) complex polynomials of fixed degrees $d$, with arbitrarily high…

Dynamical Systems · Mathematics 2011-08-31 Béla Bollobás , Malte Lackmann , Dierk Schleicher

A challenging problem in computational mathematics is to compute roots of a high-degree univariate random polynomial. We combine an efficient multiprecision implementation for solving high-degree random polynomials with two certification…

We study the regularity of the roots of complex univariate polynomials whose coefficients depend smoothly on parameters. We show that any continuous choice of the roots of a $C^{n-1,1}$-curve of monic polynomials of degree $n$ is locally…

Classical Analysis and ODEs · Mathematics 2021-04-06 Adam Parusinski , Armin Rainer

In this note we study asymptotic isotopy of random real algebraic plane curves. More precisely, we obtain a Kac-Rice type formula that gives the expected number of two-sided components (i.e.\ ovals) of a random real algebraic plane curve…

Algebraic Geometry · Mathematics 2026-04-22 Turgay Bayraktar , Ali Ulaş Özgür Kişisel

We consider random trigonometric polynomials with general dependent coefficients. We show that under mild hypotheses on the structure of dependence, the asymptotics as the degree goes to infinity of the expected number of real zeros…

Probability · Mathematics 2024-09-24 Jürgen Angst , Oanh Nguyen , Guillaume Poly

In analogy with the regularity lemma of Szemer\'edi, regularity lemmas for polynomials shown by Green and Tao (Contrib. Discrete Math. 2009) and by Kaufman and Lovett (FOCS 2008) modify a given collection of polynomials \calF =…

Computational Complexity · Computer Science 2013-11-21 Arnab Bhattacharyya , Pooya Hatami , Madhur Tulsiani