𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Lp-Generalization of a Theorem of Adamyan, Arov, and Kreın

✍ Scribed by V.A. Prokhorov

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
149 KB
Volume
116
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a generalization of Rubin's theorem
On a generalization of Rubin's theorem
✍ Dmitry A. Shabanov 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB

The work is devoted to the calculation of asymptotic value of the choice number of the complete r-partite graph K m \* r = K m,. ..,m with equal part size m. We obtained the asymptotics in the case ln r = o(ln m). The proof generalizes the classical result of A.L. Rubin for the case r = 2.

On one generalization of a DiPerna and M
On one generalization of a DiPerna and Majda theorem
✍ Agnieszka Kałamajska 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

## Abstract The weak limits of sequences {__f__(__u^ν^__)}~__ν__∈ℕ~ where __u^ν^__'s are vector‐valued µ‐measurable functions defined on a compact set Ω and __f__ is (possibly) discontinuous are investigated. As shown by the author (__J. Conv. Anal__. (to appear)), they are described in terms of in

A generalization of Turán's theorem
A generalization of Turán's theorem
✍ Benny Sudakov; Tibor Szabó; H. Van Vu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract In this paper, we obtain an asymptotic generalization of Turán's theorem. We prove that if all the non‐trivial eigenvalues of a __d__‐regular graph __G__ on __n__ vertices are sufficiently small, then the largest __K__~__t__~‐free subgraph of __G__ contains approximately (__t__ − 2)/(__