aInstitute of Mathematics, Armenian Academy of Sciences, Marshal Bagramian street 24b, 375019 Yerevan, Armenia
Abstract:
For any 0<t<1 we construct a Weak Thresholding Greedy Algorithm with weakness parameter t which converges in L1(0,1) with respect to the Haar system, i. e. the Haar system is a ‘good non quasi-greedy basis’.