Related papers: Counting polynomials with positive roots

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…

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

We show that if two monic polynomials with integer coefficients have square-free resultant, then all positive divisors of the resultant arise as the greatest common divisor of the values of the two polynomials at a suitable integer.

Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.

We investigate the asymptotics of the expected number of real roots of random trigonometric polynomials $$ X_n(t)=u+\frac{1}{\sqrt{n}}\sum_{k=1}^n (A_k\cos(kt)+B_k\sin(kt)), \quad t\in [0,2\pi],\quad u\in\mathbb{R} $$ whose coefficients…

We consider random trigonometric polynomials with general dependent coefficients. We show that under mild hypotheses on the structure of dependence, the asymptotics as the degree goes to infinity of the expected number of real zeros…

We study a map that sends a monic degree n complex polynomial f(x) without multiple roots to the collection of n values of its derivative at the roots of f(x). We give an answer to a question posed by Ju.S. Ilyashenko.

For the general monic cubic and quartic with real coefficients, polynomial conditions on the coefficients are derived as directly and as simply as possible from the Sturm sequence that will determine the real and complex root multiplicities…

We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…

A hyperbolic polynomial (HP) is a real univariate polynomial with all roots real. By Descartes' rule of signs a HP with all coefficients nonvanishing has exactly $c$ positive and exactly $p$ negative roots counted with multiplicity, where…

Let $f\in\mathbb{Z}[X]$ be quadratic or cubic polynomial. We prove that there exists an integer $G_f\geq 2$ such that for every integer $k\geq G_f$ one can find infinitely many integers $n\geq 0$ with the property that none of…

We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.

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$.…

Below we discuss the partition of the space of real univariate polynomials according to the number of positive and negative roots and signs of the coefficients. We present several series of non-realizable combinations of signs together with…

We characterize polynomials having the same set of nonzero cyclic resultants. Generically, for a polynomial $f$ of degree $d$, there are exactly $2^{d-1}$ distinct degree $d$ polynomials with the same set of cyclic resultants as $f$.…

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

We show in this paper that the roots $x_1$ and $x_2$ of a scalar quadratic polynomial $ax^2+bx+c=0$ with real or complex coefficients $a$, $b$ $c$ can be computed in a element-wise mixed stable manner, measured in a relative sense. We also…

We study the asymptotic distribution of roots of Lommel polynomials as polynomials of the order with a variable and purely imaginary argument. The roots are complex and accumulate on certain curves in the complex plane. We prove existence…

We show that detecting real roots for honestly n-variate (n+2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any fixed n. The best previous complexity bounds were exponential in…

The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…