✦ LIBER ✦

Bounds for the Roots of Lacunary Polynomials

✍ Scribed by Maurice Mignotte

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 200 KB
Volume: 30
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.2000.0373

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Bounds for Absolute Positiveness of Mult

Bounds for Absolute Positiveness of Multivariate Polynomials

✍ H. Hong 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 451 KB

A multivariate polynomial P (x 1 , . . . , xn) with real coefficients is said to be absolutely positive from a real number B iff it and all of its non-zero partial derivatives of every order are positive for x 1 , . . . , xn ≥ B. We call such B a bound for the absolute positiveness of P . This paper

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

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 roots of strongly connected relia

On the roots of strongly connected reliability polynomials

✍ J. I. Brown; K. Dilcher 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB 👁 1 views

Polynomial Bounds for the Solutions of a

Polynomial Bounds for the Solutions of a Class of Diophantine Equations

✍ Dimitrios Poulakis 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 320 KB

Let K be an algebraic number field such that all the embeddings of K into C are real. We denote by O K the ring of algebraic integers of K. Let F(X, Y) be an irreducible polynomial in K[X, Y ]&K[Y ] of total degree N and of degree n>0 in Y. We denote by F N (X, Y ) its leading homogeneous part. Supp