✦ LIBER ✦

Polynomial roots: The ultimate answer?

✍ Scribed by L. Brugnano; D. Trigiante

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 697 KB
Volume: 225
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(93)00341-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the roots of cauchy polynomials

✍ K.P. Hadeler; G. Meinardus 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 734 KB

Polynomial relations among the nth roots

Polynomial relations among the nth roots of one

✍ David R. Richman 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 199 KB

On the Roots of Orthogonal Polynomials a

On the Roots of Orthogonal Polynomials and Euler-Frobenius Polynomials

✍ F. Dubeau; J. Savoie 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 433 KB

On the greedoid polynomial for rooted gr

On the greedoid polynomial for rooted graphs and rooted digraphs

✍ Elizabeth W. McMahon 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 499 KB

## Abstract We examine some properties of the 2‐variable greedoid polynomial __f__(__G·,t,z__) when __G__ is the branching greedoid associated to a rooted graph or a rooted directed graph. For rooted digraphs, we show a factoring property of __f__(__G·,t,z__) determines whether or not the rooted di

Bounds for the Roots of Lacunary Polynom

Bounds for the Roots of Lacunary Polynomials

✍ Maurice Mignotte 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 200 KB

We give bounds for the roots of such polynomials with complex coefficients. These bounds are much smaller than for general polynomials.