2001
DOI: 10.1090/s0002-9939-01-06162-7
|View full text |Cite
|
Sign up to set email alerts
|

On the interpolation constant for Orlicz spaces

Abstract: Abstract. In this paper we deal with the interpolation from Lebesgue spaces L p and L q , into an Orlicz space L ϕ , where 1 ≤ p < q ≤ ∞ and ϕ −1 (t) = t

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
7
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(7 citation statements)
references
References 17 publications
0
7
0
Order By: Relevance
“…Next, we introduce a class of Young functions with polynomial behavior at zero and infinity. This class of Young functions has been considered in [12] in the context of interpolation spaces and it guarantees that associated Orlicz spaces are interpolation spaces between L p spaces. Lemma 2.6.…”
Section: Lemma 24 (Generalized Minkowski Inequality)mentioning
confidence: 99%
See 3 more Smart Citations
“…Next, we introduce a class of Young functions with polynomial behavior at zero and infinity. This class of Young functions has been considered in [12] in the context of interpolation spaces and it guarantees that associated Orlicz spaces are interpolation spaces between L p spaces. Lemma 2.6.…”
Section: Lemma 24 (Generalized Minkowski Inequality)mentioning
confidence: 99%
“…Hence, f possesses a inverse f −1 : (0, ∞) → (0, ∞), which is again continuous and strictly increasing. For the convexity of f −1 we refer to [12]. It follows from (7)…”
Section: Lemma 24 (Generalized Minkowski Inequality)mentioning
confidence: 99%
See 2 more Smart Citations
“…Strictly speaking, complex Orlicz-space interpolation [22,21] is not applicable simply because the left hand side of (2.26) is only bi-sublinear and not bilinear in f and g. Various linearization tricks on C d would necessarily blow up the constant as d → ∞. However, in many applications of bilinear embeddings we need to control a bilinear form, which, in turn, often appears by dualizing a linear operator L as (f, g) → Lf, g L 2 (R d ) .…”
Section: 25)mentioning
confidence: 99%