Related papers: Root Statistics of Random Polynomials with Bounded…
This article presents some interesting and novel results concerning the average modulus of random polynomials on the unit circle and the unit disc, with coefficients distributed as standard normal variates. The paper also introduces new…
We prove that the largest and smallest root in modulus of random Kac polynomials have a non-universal behavior. They do not converge towards the edge of the support of the limiting distribution of the zeros. This non-universality is…
Multiple root estimation problems in statistical inference arise in many contexts in the literature. In the context of maximum likelihood estimation, the existence of multiple roots causes uncertainty in the computation of maximum…
We present a new data structure to approximate accurately and efficiently a polynomial $f$ of degree $d$ given as a list of coefficients. Its properties allow us to improve the state-of-the-art bounds on the bit complexity for the problems…
How many operations do we need on the average to compute an approximate root of a random Gaussian polynomial system? Beyond Smale's 17th problem that asked whether a polynomial bound is possible, we prove a quasi-optimal bound $\text{(input…
A new measure called min-max elementwise backward error is introduced for approximate roots of scalar polynomials $p(z)$. Compared with the elementwise relative backward error, this new measure allows for larger relative perturbations on…
Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…
We develop two algorithms, based on maximum likelihood (ML) inference, for estimating the parameters of polarized radio sources which emit at a single rotation measure (RM), e.g., pulsars. These algorithms incorporate the flux density…
The complexity of the algorithm Radix Selection is considered for independent data generated from a Markov source. The complexity is measured by the number of bucket operations required and studied as a stochastic process indexed by the…
To determine the dimension of null space of any given linearized polynomial is one of vital problems in finite field theory, with concern to design of modern symmetric cryptosystems. But, the known general theory for this task is much far…
The Durand-Kerner algorithm is a widely used iterative technique for simultaneously finding all the roots of a polynomial. However, its convergence heavily depends on the choice of initial approximations. This paper introduces two novel…
The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…
We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…
We introduce the ratio of the number of roots of a polynomial $P_{d}$, less than one in modulus, to its degree $d$ as an alternative to Mahler measure. We investigate some properties of the alternative. We generalise this definition for a…
In this paper, we study functions of the roots of a univariate polynomial in which the roots have a given multiplicity structure $\mu$. Traditionally, root functions are studied via the theory of symmetric polynomials; we extend this theory…
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\}$…
We consider a generalization of the Mahler measure of a multivariable polynomial $P$ as the integral of $\log^k|P|$ in the unit torus, as opposed to the classical definition with the integral of $\log|P|$. A zeta Mahler measure, involving…
Let $f_n$ be a random polynomial of degree $n$ with i.i.d. mean-zero and finite variance random coefficients. It is well known that the roots of $f_n$ cluster uniformly around the unit circle as $n$ grows large. We give a simple and…
The paper deals with root problems for two classes of univariate polynomials both of geometric origin. The first class discussed, the class of Steiner polynomial, consists of polynomials, each associated with a compact convex set V in R^n.…
Let $K$ be a complete non-archimedean field with a discrete valuation, $f\in K[X]$ a polynomial with non-vanishing discriminant, $A$ the valuation ring of $K$, and $\M$ the maximal ideal of $A$. The first main result of this paper is a…