相关论文: Random polynomials having few or no real zeros

We investigate the mean number of real zeros over an interval $[a,b]$ of a random trigonometric polynomial of the form $\sum_{k=1}^n a_k \cos(kt)+b_k \sin(kt)$ where the coefficients are i.i.d. random variables. Under mild assumptions on…

We study the zero distribution of non-orthogonal polynomials attached to $g(n)=s(n)=n^2$: \begin{equation*} Q_n^g(x)= x \sum_{k=1}^n g(k) \, Q_{n-k}^g(x), \quad Q_0^g(x):=1. \end{equation*} It is known that the case $g=id$ involves…

In this paper, we investigate the solubility of homogeneous polynomial equations. The work of Browning, Le boudec, Sawin [3] shows that almost all homogeneous equations of degree $d\geq 4$ in $d+1$ or more variables satisfy the Hasse…

Given $f\in \mathbb{Z}[t]$ of positive degree, we investigate the existence of auxiliary polynomials $g\in \mathbb{Z}[t]$ for which $f(g(t))$ factors as a product of polynomials of small relative degree. One consequence of this work shows…

It is shown that if $f$ or $1/f$ is a real entire function of infinite order of growth, with only real zeros, then $f''+\omega f$ has infinitely many non-real zeros for any $\omega > 0$.

We study the number of real roots of a Kostlan random polynomial of degree $d$ in one variable. More generally, we are interested in the distribution of the counting measure of the set of real roots of such a polynomial. We compute the…

We show that the Galois group of a random monic polynomial %of degree $d>12$ with integer coefficients between $-N$ and $N$ is NOT $S_d$ with probability $\ll \frac{\log^{\Omega(d)}N}{N}.$ Conditionally on NOTbeing the full symmetric group,…

We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by…

Results of somewhat mysterious nature are known on the location of zeros of certain polynomials associated with statistical mechanics (Lee-Yang circle theorem) and also with graph counting. In an attempt at clarifying the situation we…

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…

We define a necessary and sufficient condition on a polynomial $h\in \mathbb{Z}[x]$ to guarantee that every set of natural numbers of positive upper density contains a nonzero difference of the form $h(p)$ for some prime $p$. Moreover, we…

Let $\mathcal{P}$ be a graph property which is preserved by removal of edges, and consider the random graph process that starts with the empty $n$-vertex graph and then adds edges one-by-one, each chosen uniformly at random subject to the…

The Rogers-Szeg\"o polynomials are natural q-analogues of Newton binomials. In general they have no closed expression. We consider some exceptional cases which are products of a factor with a closed formula and another one with nice values…

In this article, we study critical points (zeros of derivative) of random polynomials. Take two deterministic sequences $\{a_n\}_{n\geq1}$ and $\{b_n\}_{n\geq1}$ of complex numbers whose limiting empirical measures are same. By choosing…

By Descartes' rule of signs, a real degree $d$ polynomial $P$ with all nonvanishing coefficients, with $c$ sign changes and $p$ sign preservations in the sequence of its coefficients ($c+p=d$) has $pos\leq c$ positive and $neg\leq p$…

We show that for every subset $E$ of positive density in the set of integer square-matrices with zero traces, there exists an integer $k \geq 1$ such that the set of characteristic polynomials of matrices in $E-E$ contains the set of…

We give a criterion which characterizes a homogeneous real multi-variate polynomial to have the property that all sufficiently large powers of the polynomial (as well as their products with any given positive homogeneous polynomial) have…

It is known that the weight (that is, the number of nonzero coefficients) of a univariate polynomial over a field of characteristic zero is larger than the multiplicity of any of its nonzero roots. We extend this result to an appropriate…

We investigate the computational problem of determining whether a bivariate polynomial with non-negative coefficients and no constant term can attain a prime value. While classical conjectures such as Bouniakowsky's provide necessary…

Let \tau(.) be the Ramanujan \tau-function, and let k be a positive integer such that \tau(n) is not 0 for n=1,...,[k/2]. (This is known to be true for k < 10^{23}, and, conjecturally, for all k.) Further, let s be a permutation of the set…