✦ LIBER ✦

On the location of roots of non-reciprocal integer polynomials

✍ Scribed by Artūras Dubickas

Publisher: Springer
Year: 2010
Tongue: English
Weight: 228 KB
Volume: 22
Category: Article
ISSN: 0938-1279
DOI: 10.1007/s00200-010-0134-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the location of roots of Steiner poly

On the location of roots of Steiner polynomials

✍ Martin Henk; María A. Hernández Cifre 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 185 KB

Note on the location of the roots of a p

Note on the location of the roots of a polynomial

✍ J. L. Walsh 📂 Article 📅 1926 🏛 Springer-Verlag 🌐 French ⚖ 559 KB

Integer Roots Chromatic Polynomials of N

Integer Roots Chromatic Polynomials of Non-Chordal Graphs and the Prouhet-Tarry-Escott Problem

✍ Santos Hernández; Florian Luca 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 84 KB

The maximal conjugate of a non-reciproca

The maximal conjugate of a non-reciprocal algebraic integer

✍ A. Dubickas 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 211 KB

Distances from differences of roots of p

Distances from differences of roots of polynomials to the nearest integers

✍ V.I. Galiev; A.F. Polupanov; I.E. Shparlinski 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 325 KB

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