2011
DOI: 10.1002/mana.200810108
|View full text |Cite
|
Sign up to set email alerts
|

Reiteration theorems for the K -interpolation method in limiting cases

Abstract: Sharp reiteration theorems for the K-interpolation method in limiting cases are proved using two-sided estimates of the K-functional. As an application, sharp mapping properties of the Riesz potential are derived in a limiting case.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
44
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 29 publications
(45 citation statements)
references
References 9 publications
1
44
0
Order By: Relevance
“…. , α n ) let's denote λ A (t) := λ α 1 1 · · · · · λ α n n . All functions λ k and λ A are slowly varying functions in the sense of [21, Definition 2.1].…”
Section: Iterated Logarithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…. , α n ) let's denote λ A (t) := λ α 1 1 · · · · · λ α n n . All functions λ k and λ A are slowly varying functions in the sense of [21, Definition 2.1].…”
Section: Iterated Logarithmsmentioning
confidence: 99%
“…For this purpose we modified the technique of [17]. In the case θ = 1 we use apposite reiteration formulae of [1]. In the case θ = 0 it is not necessary because the proof of Theorem 1 is valid for θ = 0, too.…”
Section: Introductionmentioning
confidence: 98%
See 1 more Smart Citation
“…However, to get a meaningful definition they need to insert powers of the function g(t) = 1 + | log t| (see, for example, [18] or [19]) or, more generally, certain slowly varying function (see [1], [22]). We do not use here any weight of these kinds but the suitable term with the supremum which corresponds to the norm of the Gagliardo completion of A j in A 0 + A 1 (j = 0, 1) (see [3]).…”
Section: Limiting K-spacesmentioning
confidence: 99%
“…Let (Ω, μ) be a σ-finite measure space. If μ(Ω) = 1, then we are in the ordered case with L ∞ → L 1 , and it is shown in [23] that (L ∞ , L 1 ) 1,1;K = L log L = L 1 (log L) 1 .…”
Section: Remark 33 If We Are In the Ordered Case Wherementioning
confidence: 99%