𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Maximum Modulus of Polynomials

✍ Scribed by K.K. Dewan; J. Kaur

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
114 KB
Volume
181
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis

A well-known result of Rivlin states that if (p(z)) is a polynomial of degree (n), such that (p(z) \neq 0) in (|z|<1), then (\max _{1:} \quad, \quad|p(z)| \geqslant((r+1) / 2)^{n} \max _{1: 1},|p(z)|). In this paper, we prove a generalization and refinements of this result. 1994 Academic Prem. Inc.

πŸ“œ SIMILAR VOLUMES

Bernstein Polynomials and Modulus of Con
Bernstein Polynomials and Modulus of Continuity
✍ Zhongkai Li πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 89 KB

p n, j (x)= \ n j + x j (1&x) n& j of a given function f (x) on [0, 1], besides the convergence and approximation, preserve some properties of the original function. For example: (i) if f (x) is non-decreasing, then for all n 1, the B n ( f; x) are nondecreasing; (ii) if f (x) is convex, then for

Maximum chromatic polynomials of 2-conne
Maximum chromatic polynomials of 2-connected graphs
✍ Ioan Tomescu πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 345 KB πŸ‘ 1 views

## Abstract In this paper we obtain chromatic polynomials __P(G__; Ξ») of 2‐connected graphs of order __n__ that are maximum for positive integer‐valued arguments Ξ» ≧ 3. The extremal graphs are cycles __C__~__n__~ and these graphs are unique for every Ξ» ≧ 3 and __n__ β‰  5. We also determine max{__P(