Strong partially greedy bases and Lebesgue-type inequalities
Functional Analysis
2020-02-11 v2
Abstract
In this paper we continue the study of Lebesgue-type inequalities for greedy algorithms. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesgue-type parameters associated with them. We prove that this property is equivalent to that of being conservative and quasi-greedy, extending a similar result given in [9] for Schauder bases. We also give a characterization of 1-strong partial greediness, following the study started in [1,3].
Keywords
Cite
@article{arxiv.2001.01226,
title = {Strong partially greedy bases and Lebesgue-type inequalities},
author = {Miguel Berasategui and Pablo M. Berná and Silvia Lassalle},
journal= {arXiv preprint arXiv:2001.01226},
year = {2020}
}
Comments
Corrected typos and improved redaction; results unchanged