1975
DOI: 10.1070/sm1975v027n03abeh002519
|View full text |Cite
|
Sign up to set email alerts
|

DIRECT AND CONVERSE THEOREMS OF JACKSON TYPE IN $ L^p$ SPACES, $ 0<p<1$

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
15
0

Year Published

1992
1992
2019
2019

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(15 citation statements)
references
References 6 publications
0
15
0
Order By: Relevance
“…Zygmund [3] extended inequalities (0.2) and (0.3) to the norms ⋅ p , 1 ≤ p < ∞. The method of Zygmund for 0 < p < 1 (trigonometric interpolation) was used by Ivanov [4] and Storozhenko, Krotov, and Oswald [5], but an additional constant depending on p appeared in inequalities of the type (0.2). In 1981, Arestov [6] proposed a new method for the proof of inequality (0.2) for any 0 ≤ p < 1 and its analog in classes ϕ ( ) L .…”
Section: Introduction and Formulation Of The Main Resultsmentioning
confidence: 99%
“…Zygmund [3] extended inequalities (0.2) and (0.3) to the norms ⋅ p , 1 ≤ p < ∞. The method of Zygmund for 0 < p < 1 (trigonometric interpolation) was used by Ivanov [4] and Storozhenko, Krotov, and Oswald [5], but an additional constant depending on p appeared in inequalities of the type (0.2). In 1981, Arestov [6] proposed a new method for the proof of inequality (0.2) for any 0 ≤ p < 1 and its analog in classes ϕ ( ) L .…”
Section: Introduction and Formulation Of The Main Resultsmentioning
confidence: 99%
“…Multiplying both sides of inequality (14) by the function 2 k ψ τ ( ) and integrating the obtained relation with respect to τ from 0 to h, we get…”
mentioning
confidence: 97%
“…Note that the characteristic Ω 1 ( , ) f t p had earlier been used by Storozhenko, Krotov, and Oswald in [14] for the investigation of the behavior of the best approximation of functions by polynomials in the Haar system.…”
mentioning
confidence: 98%
“…Obtaining Bernstein's inequality in Hardy spaces H p : P H p ≤ n P H p , for p < 1 had been a difficult problem (see, e.g. [14,29]). In an important paper [12], N. G. de Bruijn and T. A. Springer proved that if deg(P ) ≤ n, then…”
mentioning
confidence: 99%