✦ LIBER ✦

On a conjecture of Z. Ditzian

✍ Scribed by Ding-Xuan Zhou

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 207 KB
Volume: 69
Category: Article
ISSN: 0021-9045
DOI: 10.1016/0021-9045(92)90140-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Conjecture of Ditzian and Runovskii

✍ Dai Feng; Wang Kunyang; Yu Chunwu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 186 KB

On a Ditzian-Totik Theorem

✍ X.H. Sun 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 91 KB

Proof of a conjecture of Z. Kopal

✍ Neal D. Newby Jr. 📂 Article 📅 1964 🏛 Elsevier Science 🌐 English ⚖ 148 KB

On the Sharpness of a Jackson Estimate b

On the Sharpness of a Jackson Estimate by Ditzian–Totik

✍ L. Imhof 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Using ideas of Gru nwald, Marcinkiewicz, and Ve rtesi concerning the divergence of interpolation processes, a counterexample is constructed which establishes that a Jackson estimate for the best approximation by algebraic polynomials given by Ditzian and Totik is sharp in a pointwise sense everywher

On a Conjecture of Chalk

✍ Ping Ding 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Let f # Z[x] with degree k and let p be a prime. By a complete trigonometric sum we mean a sum of the form S(q, f )= q x=1 e q ( f (x)), where q is a positive integer and e q (:)=exp(2?if (x)Âq). Professor Chalk made a conjecture on the upper bound of S(q, f ) when q is a prime power. We prove Chalk

On a Conjecture of Woodall

✍ Hao Li 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Dirac proved in 1952 that every 2-connected graph of order n and minimum degree k admits a cycle of length at least minfn; 2kg: As a possible improvement, Woodall conjectured in 1975 that if a 2-connected graph of order n has at least n 2 þ k vertices of degree at least k; then it has a cycle of len