𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximal Points of Stable and Related Polynomials

✍ Scribed by Franck Beaucoup

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
239 KB
Volume
93
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that any polynomial having all its roots in a closed half-plane, whose boundary contains the origin, has either one or two maximal points, and only one if it has at least one root in the open half-plane. This result concerns stable polynomials as well as polynomials having only real roots, including real orthogonal polynomials.

πŸ“œ SIMILAR VOLUMES

Maximal chromatic polynomials of connect
Maximal chromatic polynomials of connected planar graphs
✍ Ioan Tomescu πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 429 KB πŸ‘ 1 views

## Abstract In this paper we obtain chromatic polynomials of connected 3‐ and 4‐chromatic planar graphs that are maximal for positive integer‐valued arguments. We also characterize the class of connected 3‐chromatic graphs having the maximum number of __p__‐colorings for __p__ β‰₯ 3, thus extending a

Zeros and Critical Points of Sobolev Ort
Zeros and Critical Points of Sobolev Orthogonal Polynomials
✍ W. Gautschi; A.B.J. Kuijlaars πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 340 KB

Using potential theoretic methods we study the asymptotic distribution of zeros and critical points of Sobolev orthogonal polynomials, i.e., polynomials orthogonal with respect to an inner product involving derivatives. Under general assumptions it is shown that the critical points have a canonical

Maximal Οƒ-polynomials of connected 3-chr
Maximal Οƒ-polynomials of connected 3-chromatic graphs
✍ Ioan Tomescu πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 113 KB πŸ‘ 1 views

## Abstract In the set of graphs of order __n__ and chromatic number __k__ the following partial order relation is defined. One says that a graph __G__ is less than a graph __H__ if __c__~__i__~(__G__) ≀ __c__~__i__~(__H__) holds for every __i__, __k__ ≀ __i__ ≀ __n__ and at least one inequality is