We show that the Lindenstrauss basic sequence in l₁ may be used to construct a conditional quasi-greedy basis of l₁, thus answering a question of Wojtaszczyk. We further show that the sequence of coefficient functionals for this basis is not quasi-greedy.
We consider several greedy conditions for bases in Banach spaces that arise naturally in the study of the Thresholding Greedy Algorithm (TGA). In particular, we continue the study of almost greedy bases begun in [3]. We show that almost greedy bases are essentially optimal for n-term approximation when the TGA is modified to include a Chebyshev approximation. We prove that if a Banach space X has a basis and contains a complemented subspace with a symmetric basis and finite cotype then X has an...
We study Lebesgue-type inequalities for greedy approximation with respect to quasi-greedy bases. We mostly concentrate on the spaces. The novelty of the paper is in obtaining better Lebesgue-type inequalities under extra assumptions on a quasi-greedy basis than known Lebesgue-type inequalities for quasi-greedy bases. We consider uniformly bounded quasi-greedy bases of , 1 < p < ∞, and prove that for such bases an extra multiplier in the Lebesgue-type inequality can be taken as C(p)ln(m+1)....
Page 1