Related papers: Palindromic random trigonometric polynomials
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.…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
We introduce a sequence $P_{2n}$ of monic reciprocal polynomials with integer coefficients having the central coefficients fixed. We prove that the ratio between number of nonunimodular roots of $P_{2n}$ and its degree $d$ has a limit when…
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…
In an earlier article [3], we presented an algorithm that can be used to rigorously check whether a specific cosine or sine polynomial is nonnegative in a given interval or not. The algorithm proves to be an indispensable tool in…
Given a real cubic function $f(x)$ with three roots, take an equilateral triangle $ABC$, the projections of which vertices are the roots of $f(x)$. There is a folklore fact that the vertical lines through the extrema of $f(x)$ are tangent…
We determine the probability that a random polynomial of degree $n$ over $\mathbb{Z}_p$ has exactly $r$ roots in $\mathbb{Q}_p$, and show that it is given by a rational function of $p$ that is invariant under replacing $p$ by $1/p$.
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…
The average density of zeros for monic generalized polynomials, $P_n(z)=\phi(z)+\sum_{k=1}^nc_kf_k(z)$, with real holomorphic $\phi ,f_k$ and real Gaussian coefficients is expressed in terms of correlation functions of the values of the…
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…
The reversal of a positive integer $A$ is the number obtained by reading $A$ backwards in its decimal representation. A pair $(A,B)$ of positive integers is said to be palindromic if the reversal of the product $A \times B$ is equal to the…
For a tree $T$, the subtree polynomial of $T$ is the generating polynomial for the number of subtrees of $T$. We show that the complex roots of the subtree polynomial are contained in the disk $\left\{z\in\mathbb{C}\colon\ |z|\leq…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
Let $\Psi_n(x)$ be the monic polynomial having precisely all non-primitive $n$th roots of unity as its simple zeros. One has $\Psi_n(x)=(x^n-1)/\Phi_n(x)$, with $\Phi_n(x)$ the $n$th cyclotomic polynomial. The coefficients of $\Psi_n(x)$…
On a probability space $(\Omega, \mathcal F, \mathbb P)$ we consider two independent sequences $(a_k)_{k \geq 1}$ and $(b_k)_{k \geq 1}$ of i.i.d. random variables that are centered with unit variance and which admit a moment strictly…
We introduce a sequence P_d of monic reciprocal polynomials with integer coefficients having the central coefficients fixed as well as the peripheral coefficients. We prove that the ratio between number of nonunimodular roots of P_d and its…
We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…
We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials,…
Motivated by problems arising in random sampling of trigonometric polynomials, we derive exponential inequalities for the operator norm of the difference between the sample second moment matrix $n^{-1}U^*U$ and its expectation where $U$ is…
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…