Abstract
In 2003, S. J. Dilworth, N. J. Kalton, D. Kutzarova and V. N. Temlyakov introduced the notion of almost greedy (respectively partially greedy) bases. These bases were characterized in terms of quasi-greediness and democracy (respectively conservativeness). In this paper, we show a new functional characterization of these type of bases in general Banach spaces following the spirit of the characterization of greediness proved in 2017 by P. M. Berná and Ó. Blasco.
Funder
Agencia Estatal de Investigación
Fundación Séneca
Ministerio de Ciencia, Innovación y Universidades
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference12 articles.
1. A remark on greedy approximation in Banach spaces;Konyagin;East J. Approx.,1999
2. Greedy Algorithm for General Biorthogonal Systems
3. Greedy approximation for biorthogonal systems in quasi-Banach spaces;Albiac;Dissertatione Math.,2021
4. The Thresholding Greedy Algorithm, Greedy Bases, and Duality
5. Strong Partially Greedy Bases and Lebesgue-Type Inequalities