The weighted Property (A) and the greedy algorithm
Functional Analysis
2018-06-19 v2
Abstract
We investigate various aspects of the "weighted" greedy algorithm with respect to a Schauder basis. For a weight w, we describe w-greedy, w-almost-greedy and w-partially-greedy bases, and show some properties of w-semi-greedy bases. To achieve these goals, we introduce and study the w-Property (A).
Keywords
Cite
@article{arxiv.1803.05052,
title = {The weighted Property (A) and the greedy algorithm},
author = {P. M. Berná and S. J. Dilworth and D. Kutzarova and T. Oikhberg and B. Wallis},
journal= {arXiv preprint arXiv:1803.05052},
year = {2018}
}
Comments
23 pages