Related papers: Root Statistics of Random Polynomials with Bounded…

We give a precise measure of the rate at which repeated differentiation of a random trigonometric polynomial causes the roots of the function to approach equal spacing. This can be viewed as a toy model of crystallization in one dimension.…

We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…

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…

We build a new probability measure on closed space and plane polygons. The key construction is a map, given by Knutson and Hausmann using the Hopf map on quaternions, from the complex Stiefel manifold of 2-frames in n-space to the space of…

We show that the Mahler measures of the Jones polynomial and of the colored Jones polynomials converge under twisting for any link. Moreover, almost all of the roots of these polynomials approach the unit circle under twisting. In terms of…

We consider a family of heights defined by the $L_p$ norms of polynomials with respect to the equilibrium measure of a lemniscate for $0 \le p \le \infty$, where $p=0$ corresponds to the geometric mean (the generalized Mahler measure) and…

Recursive maps of high order of convergence $m$ (say $m=2^{10}$ or $m=2^{20}$) induce certain monotone step functions from which one can filter relevant information needed to globally separate and compute the real roots of a function on a…

We study the roots of a random polynomial over the field of $p$-adic numbers. For a random monic polynomial with i.i.d. coefficients in $\mathbb{Z}_p$, we obtain an estimate for the expected number of roots of this polynomial. In…

We show that the sequence of moduli of the eigenvalues of a matrix polynomial is log-majorized, up to universal constants, by a sequence of "tropical roots" depending only on the norms of the matrix coefficients. These tropical roots are…

In this note we initiate the probabilistic study of the critical points of polynomials of large degree with a given distribution of roots. Namely, let f be a polynomial of degree n whose zeros are chosen IID from a probability measure mu on…

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

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…

For each $\alpha \in (0, 1)$, we construct a bounded monotone deterministic sequence $(c_k)_{k \geq 0}$ of real numbers so that the number of real roots of the random polynomial $f_n(z) = \sum_{k=0}^n c_k \varepsilon_k z^k$ is $n^{\alpha +…

We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…

Kernel methods are successful approaches for different machine learning problems. This success is mainly rooted in using feature maps and kernel matrices. Some methods rely on the eigenvalues/eigenvectors of the kernel matrix, while for…

In this article, we investigate the statistical distribution and asymptotic behavior of the family of monic integer polynomials of degree $n$ having at least one root in a fixed number field $K$. Although the framework of thin sets implies…

An accurate assessment of a model's complexity is crucial for topics such as interpretation, generalization, and model selection. However, most existing complexity measures either rely on heuristic assumptions or are computationally…

The Kac polynomial $$f_n(x) = \sum_{i=0}^{n} \xi_i x^i$$ with independent coefficients of variance 1 is one of the most studied models of random polynomials. It is well-known that the empirical measure of the roots converges to the uniform…

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented…