✦ LIBER ✦

Polynomial Minimum Root Separation

✍ Scribed by George E. Collins

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 201 KB
Volume: 32
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.2001.0481

No coin nor oath required. For personal study only.

✦ Synopsis

There is a well-known lower bound, due to Mignotte, for the minimum root separation of a squarefree integral polynomial, but no evidence for the sharpness of this bound. This paper provides massive computational evidence for a conjectured much larger bound, one that is approximately the square root of Mignotte's bound.

📜 SIMILAR VOLUMES

Polynomial Root Clustering

✍ T.A. Bickart; E.I. Jury 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 536 KB

## A sequence of tests on derived polynomials to be strictly Hurwitz polynomials is shown to be equivalent to a given (typically real) polynomial having all its zeros in an open sector, symmetric with respect to the real axis, in the left half-plane. 7'he number of tests needed is at most 1 + [(In

Polynomial Relations between Polynomial

Polynomial Relations between Polynomial Roots

✍ G. Baron; M. Drmota; M. Skalba 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 738 KB

Regions of polynomial root clustering

✍ T.A. Bickart; E.I. Jury 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 672 KB

A criterion for root exclusion from a region composed as a union of elemental regions-discs and halfplanes-is established. Associated with each elemental region is a derived polynomial which must be by the criterion a strictly Hurwitz polynomial. The criterion is the basis for a root exclusion test,

Polynomial roots: The ultimate answer?

✍ L. Brugnano; D. Trigiante 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 697 KB

Multidimensional interpolation by polyno

Multidimensional interpolation by polynomial roots

✍ John W. Downing; Josef Michl; Jití Cˇízˇek; Josef Paldus 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 275 KB

A new procedure is proposed for interpolation and extrapolation of functions by a root of a low=degree polynomial. Three examples of the application of the procedure are presented. The rms error in representing SCF surfaces ranges from 2 cal/mole (linear HCN) to 0.23 kcal/mole (C2v MgH2 triplet).

On the Roots of Chromatic Polynomials

✍ Jason I. Brown 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 158 KB

It is proved that the chromatic polynomial of a connected graph with n vertices and m edges has a root with modulus at least (m&1)Â(n&2); this bound is best possible for trees and 2-trees (only). It is also proved that the chromatic polynomial of a graph with few triangles that is not a forest has a