𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization for the Kuratowski Limits of a Sequence of Sobolev Spaces

✍ Scribed by Dorin Bucur


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
300 KB
Volume
151
Category
Article
ISSN
0022-0396

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On the Bourgain, Brezis, and Mironescu T
✍ V. Maz'ya; T. Shaposhnikova 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 112 KB

The article is concerned with the Bourgain, Brezis and Mironescu theorem on the asymptotic behaviour of the norm of the Sobolev-type embedding operator: W s;p ! L pn=ðnÀspÞ as s " 1 and s " n=p: Their result is extended to all values of s 2 ð0; 1Þ and is supplied with an elementary proof. The relati

A Characterization of the Quasi-Normable
✍ Reinhold Meise; Dietmar Vogt 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 466 KB

## Preface. The class of quasi-normable locally convex spaces has been introduced by GROTHENDIECK [4]. Recently VALDIVIA [7] and BIERSTEDT, NEISE and SUMXERS [2], [3] independently gave a characterization of the quasirnormability of the FR~CRET-KOTHE spaces A(A) resp. P ( I , A ) in terms of the K

The Generalization of Paraproducts and t
✍ Kunchuan Wang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 350 KB

We study the boundedness of generalized Calderon᎐Zygmund operators acting ón Sobolev and, more generally, Triebel᎐Lizorkin spaces of arbitrary order of Ž ␥ . Ž ␥ . smoothness. We are able to relax the assumptions T x s 0 andror T \* x s 0, which have been required in earlier results by other authors

A Characterization of the degree sequenc
✍ Prosenjit Bose; Vida Dujmovi; Danny Krizanc; Stefan Langerman; Pat Morin; David 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 1 views

## Abstract A graph __G__ is a 2‐tree if __G__ = __K__~3~, or __G__ has a vertex __v__ of degree 2, whose neighbors are adjacent, and __G__/ __v__ is a 2‐ tree. A characterization of the degree sequences of 2‐trees is given. This characterization yields a linear‐time algorithm for recognizing and r