arXiv · 1803.05052
The weighted Property (A) and the greedy algorithm
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).
Explore related subjects
Keep this discovery
P. M. Berná, S. J. Dilworth, D. Kutzarova, T. Oikhberg, B. Wallis. 2018-03-13. The weighted Property (A) and the greedy algorithm. https://arxiv.org/abs/1803.05052
Cite the original work for its findings. Save a collection to share your selection of sources.