✦ LIBER ✦

On the real roots of Euler polynomials

✍ Scribed by Hubert Delange

Publisher: Springer Vienna
Year: 1988
Tongue: English
Weight: 864 KB
Volume: 106
Category: Article
ISSN: 0026-9255
DOI: 10.1007/bf01298833

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Virtual roots of real polynomials

✍ Laureano Gonzalez-Vega; Henri Lombardi; Louis Mahé 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 888 KB

The fact that a real univariate polynomial misses some real roots is usually overcome by considering complex roots, but the price to pay for, is a complete loss of the sign structure that a set of real roots is endowed with (mutual position on the line, signs of the derivatives, etc.). In this paper

Calculation of the real roots of polynom

Calculation of the real roots of polynomials

✍ G.S. Ganshin 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 220 KB

Topological complexity and real roots of

Topological complexity and real roots of polynomials

✍ V. A. Vassiliev 📂 Article 📅 1996 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 544 KB

Recent Advances on Determining the Numbe

Recent Advances on Determining the Number of Real Roots of Parametric Polynomials

✍ Lu Yang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 282 KB

An explicit criterion for the determination of the numbers and multiplicities of the real/imaginary roots for polynomials with symbolic coefficients is based on a Complete Discrimination System (CDS). A CDS is a set of explicit expressions in terms of the coefficients that are sufficient for determi

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