We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the weak Chebyshev greedy algorithm (WCGA), a generalization of the weak orthogonal matching pursuit to the case of a Banach space. The main novelty of these results is a Banach space setting instead of a Hilbert space setting. The results are proved for redundant dictionaries satisfying certain conditions. Then we apply these general results to the case of bases. In particular, we prove that the WCGA provides almost optimal sparse approximation for the trigonometric system in $L_p$, $2\le p<\infty $.

A Banach space X is said to have the Dunford-Pettis Property if every weakly compact linear operator T: X —> Y, where Y is any Banach space, is completely continuous (that is, T maps weakly convergent sequences to strongly convergent ones). In this paper, we prove that if A is a nest algebra of operators on a separable, infinite dimensional Hilbert space, then A fails to have the Dunford-Pettis Property. We also investigate a certain algebra associated to A, analogous to a construction used by Bourgain and others in connection with the Dunford-Pettis Property for function algebras. We show that this algebra must lie between A and the quasi-triangular algebra A + K and we give examples to show that either extreme or something in between is possible. Finally, we consider the algebra of analytic Toeplitz operators and give a result for the corresponding associated algebra which is analogous to a result of Cima, Jansen, and Yale for H∞.

This paper presents a criterion of KUR for sequence Orlicź spaces with Luxemburg's norm. The result also indicates that for any integer k ≥ 1, there exists a k + 1-uniformly rotund Banach space not being k-uniformly rotund.