On the Determination of the Number of Positive and Negative Polynomial Zeros and Their Isolation

Emil M. Prodanov

doi:10.1515/math-2020-0079

Home/Archive/arXiv

arXiv · 1901.05960

On the Determination of the Number of Positive and Negative Polynomial Zeros and Their Isolation

Emil M. Prodanov

View original source ↗Read source document ↗Export metadata ↓

Abstract

A novel method with two variations is proposed with which the number of positive and negative zeros of a polynomial with real coefficients and degree $n$ can be restricted with significantly better determinacy than that provided by the Descartes rule of signs and also isolate quite successfully the zeros of the polynomial. The method relies on solving equations of degree smaller than that of the given polynomial. One can determine analytically the exact number of positive and negative zeros of a polynomial of degree up to and including five and also fully isolate the zeros of the polynomial analytically and with one of the variations of the method, one can analytically approach polynomials of degree up to and including nine by solving equations of degree no more than four. For polynomials of higher degree, either of the two variations of the method should be applied recursively. Full classification of the roots of the cubic equation, together with their isolation intervals, is presented. Numerous examples are given.

Explore related subjects

math.GM

Keep this discovery

BibTeX RIS

Emil M. Prodanov. 2019-01-17. On the Determination of the Number of Positive and Negative Polynomial Zeros and Their Isolation. https://doi.org/10.1515/math-2020-0079

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗

arXiv2026

The decrease in sectional curvature of the Fisher--Rao manifold of beta distributions

In the paper, the author develops a general convexity lemma and applies it to demonstrate the monotonic decrease of a function involving polygamma functions, arising from the sectional curvature of the Fisher--Rao manifold of beta distributions.

math.GM↗

arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗