Related papers: Roots of random polynomials with coefficients havi…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

We give an anecdotal discussion of the problem of searching for polynomials with all roots on the unit circle, whose coefficients are rational numbers subject to certain congruence conditions. We illustrate with an example from a…

This paper is devoted to several new results concerning (standard) octonion polynomials. The first is the determination of the roots of all right scalar multiples of octonion polynomials. The roots of left multiples are also discussed,…

For an arbitrary positive integer n, we construct infinitely many one-cusped hyperbolic 3-manifolds where each manifold's A-polynomial detects every n-th root of unity. This answers a question of Cooper, Culler, Gillet, Long, and Shalen as…

For any fixed positive integer $n$, we study the root distribution of a sequence of polynomials $H_{m}(z)$ satisfying the rational generating function \[ \sum_{m=0}^{\infty}H_{m}(z)t^{m}=\frac{1}{1+B(z)t+A(z)t^{n}} \] where $A(z)$ and…

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 +…

In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…

Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…

In this paper, we consider modular local polynomials. These functions satisfy modularity while they are locally defined as polynomials outside of an exceptional set. We prove an inequality for the dimension of the space of such forms when…

In this note, we obtain asymptotic expected number of real zeros for random polynomials of the form $$f_n(z)=\sum_{j=0}^na^n_jc^n_jz^j$$ where $a^n_j$ are independent and identically distributed real random variables with bounded…

A new short clear proof of the asymptotics for the number $c_n$ of real roots of the Bernoulli polynomials $B_n(x)$, as well as for the maximal root $y_n$: $$y_n=\frac{n}{2\pi e}+\frac{\ln(n)}{4\pi e}+O(1)\quad\text{and}\quad…

This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed $k\ge2$. In the…

We give a new proof that the empirical measures of the roots of Eulerian polynomials converge to a certain log-Cauchy distribution. To do so, we show that each moment of the roots of a related family of polynomials not only converge, but in…

For a given monic integral polynomial $f(x)$ of degree $n$, we define local roots $r_i$ of $f(x)$ for a completely decomposable prime $p$ by $r_i \in \mathbb{Z}$, $f(r_i) \equiv 0 \bmod p$ and $0 \le r_1 \le r_2 \le \dots \le r_n < p$. With…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…

Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…

Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

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…