Related papers: Some remarks on the non-real roots of polynomials

We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line {y=ax+b}, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive an alternative algorithm to decide whether…

Suppose that f has continuous derivatives thru order r+1 for x>0, and let P_{c} denote the Taylor polynomial to f of order r at x=c,c>0. In a previous paper of the author, it was shown that if r is an odd whole number and the (r+1)st…

A polynomial is real-rooted if all of its roots are real. For every polynomial $f(t) \in {\mathbf R}[t]$, the Hermite-Sylvester theorem associates a quadratic form $\Phi_2$ such that $f(t)$ is real-rooted if and only if $\Phi_2$ is positive…

A polynomial is real-rooted if all of its roots are real. This note gives a simple proof of the Hermite-Sylvester theorem that a polynomial $f(x) \in {\mathbf R}[x]$ is real-rooted if and only if an associated quadratic form is positive…

Viewing a bivariate polynomial f in R[x,t] as a family of univariate polynomials in t parametrized by real numbers x, we call f real rooted if this family consists of monic polynomials with only real roots. If f is the characteristic…

In the process of computing the Galois group of a prime degree polynomial $f(x)$ over $\mathbb Q$ we suggest a preliminary checking for the existence of non-real roots. If $f(x)$ has non-real roots, then combining a 1871 result of Jordan…

For a polynomial $f(t) = 1+f_0t+\cdots +f_{d-1}t^d$ with positive integer coefficients Bell and Skandera ask if real rootedness of f(t) implies that there is a simplicial complex with f-vector $(1,f_0 \ldots,f_{d-1})$. In this paper we…

Let $\mathbb{F}_q$ be a finite field with $q$ elements, $f \in \mathbb{F}_q[x_1, \dots, x_n]$ a polynomial in $n$ variables and let us denote by $N(f)$ the number of roots of $f$ in $\mathbb{F}_q^n$. %Many authors, such as Wei Cao and Kung…

We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…

We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomials. Our algorithm outputs that no positive real root…

In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…

Honda and Tate showed that the isogeny classes of abelian varieties of dimension $g$ over a finite field $\mathbb{F}_q$ are classified in terms of $q$-Weil polynomials of degree $2g$, that is, monic integer polynomials whose set of complex…

We propose an efficient algorithm to compute the real roots of a sparse polynomial $f\in\mathbb{R}[x]$ having $k$ non-zero real-valued coefficients. It is assumed that arbitrarily good approximations of the non-zero coefficients are given…

Univariate polynomial root-finding is both classical and 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 polynomial…

Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set of $G$ is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of…

Given a graph $G$, its genus polynomial is $\Gamma_G(x) = \sum_{k\geq 0} g_k(G)x^k$, where $g_k(G)$ is the number of 2-cell embeddings of $G$ in an orientable surface of genus $k$. The Log-Concavity Genus Distribution (LCGD) Conjecture…

It is well known that a non-negative definite polynomial matrix (a polynomial Gramian) $G(t)$ can be written as a product of its polynomial spectral factors, $G(t) = X(t)^H X(t)$. In this paper, we give a new algebraic characterization of…

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

Consider any nonzero univariate polynomial with rational coefficients, presented as an elementary algebraic expression (using only integer exponents). Letting sigma(f) denotes the additive complexity of f, we show that the number of…