𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Minimax Problem Admitting the Equioscillation Characterization of Bernstein and Erdős

✍ Scribed by Ying Guang Shi

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

No coin nor oath required. For personal study only.

✦ Synopsis

This paper shows that under certain conditions a solution of the minimax problem min a<x 1 < } } } <x n <b max 1 i n+1 f i (x 1 , ..., x n ) admits the equioscillation characterizations of Bernstein and Erdo s and has strong uniqueness. This problem includes as a particular example the optimal Lagrange interpolation problem.

📜 SIMILAR VOLUMES

On a Problem of Erdős and Sárközy
On a Problem of Erdős and Sárközy
✍ Tomasz Schoen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 89 KB

Let A=[a 1 , a 2 , ...] N and put A(n)= a i n 1. We say that A is a P-set if no element a i divides the sum of two larger elements. It is proved that for every P-set A with pairwise co-prime elements the inequality A(n)<2n 2Â3 holds for infinitely many n # N. ## 2001 Academic Press where A(n)= a i

On A Problem of Erdős and Turán and Some
On A Problem of Erdős and Turán and Some Related Results
✍ N. Alon; M.N. Kolountzakis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 315 KB

We employ the probabilistic method to prove a stronger version of a result of Helm, related to a conjecture of Erdos and Turan about additive bases of the positive integers. We show that for a class of random sequences of positive integers \(A\), which satisfy \(|A \cap[1, x]| \gg \sqrt{x}\) with pr

Proof of a Conjecture of Bollobás and Ko
Proof of a Conjecture of Bollobás and Kohayakawa on the Erdős–Stone Theorem
✍ Yoshiyasu Ishigami 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 242 KB

For any integer r \ 1, let a(r) be the largest constant a \ 0 such that if E > 0 and 0 < c < c 0 for some small c 0 =c 0 (r, E) then every graph G of sufficiently large order n and at least edges contains a copy of any (r+1)-chromatic graph H of independence number a(H) [ (a -E) log n log(1/c) .

On the independence number of the Erdős-
On the independence number of the Erdős-Rényi and projective norm graphs and a related hypergraph
✍ Dhruv Mubayi; Jason Williford 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract The Erdős‐Rényi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have been computed and this yields an upper bound on their independence number. Here we show that