arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.01226math.FA
收藏

Strong partially greedy bases and Lebesgue-type inequalities

Miguel Berasategui, Pablo M. Berná, Silvia Lassalle

英文摘要:

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].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑