Related papers: Counting polynomials with positive roots

We show that every monic polynomial of degree three with complex coefficients and no repeated roots is either a (vertical and horizontal) translation of $y=x^3$ or can be composed with a linear function to obtain a Ramanujan cubic. As a…

Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots…

In the paper we study the distribution of the discriminant $D(P)$ of polynomials $P$ from the class $\mathcal{P}_{n}(Q)$ of all integer polynomials of degree $n$ and height at most $Q$. We evaluate the asymptotic number of polynomials $P\in…

We consider real univariate polynomials with all roots real. Such a polynomial with $c$ sign changes and $p$ sign preservations in the sequence of its coefficients has $c$ positive and $p$ negative roots counted with multiplicity. Suppose…

We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…

The classical Descartes' rule of signs limits the number of positive roots of a real polynomial in one variable by the number of sign changes in the sequence of its coefficients. One can ask the question which pairs of nonnegative integers…

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…

In this article, we investigate the statistical distribution and asymptotic behavior of the family of monic integer polynomials of degree $n$ having at least one root in a fixed number field $K$. Although the framework of thin sets implies…

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

In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In…

It is well known that a random cosine polynomial $ V_n(x) = \sum_ {j=0} ^{n} a_j \cos (j x) , \ x \in (0,2 \pi) $, with the coefficients being independent and identically distributed (i.i.d.) real-valued standard Gaussian random variables…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

In this article, we establish necessary and sufficient conditions for a polynomial of degree $n$ to have exactly $n$ real roots. A complete study of polynomials of degree five is carried out. The results are compared with those obtained…

We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…

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

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

We compute the asymptotic number of monic trace-one integral polynomials with Galois group $C_3$ and bounded height. For such polynomials we compute a height function coming from toric geometry and introduce a parametrization using the…

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

We prove a complex polynomial of degree $n$ has at most $\lceil n/2 \rceil$ attractive fixed points lying on a line. We also consider the general case.

We study the number of real critical points of a cyclotomic polynomial $\Phi_{n}(x)$, that is, the real roots of $\Phi_{n}^{\prime}(x)$. As usual, one can, without losing generality, restrict $n$ to be the product of distinct odd primes,…