The weighted Property (A) and the greedy algorithm

B. Wallis; D. Kutzarova; P.M. Bern\'a; S.J. Dilworth; T. Oikhberg

arxiv: 1803.05052 · v2 · pith:ZXGOQS7Xnew · submitted 2018-03-13 · 🧮 math.FA

The weighted Property (A) and the greedy algorithm

P.M. Bern\'a , S.J. Dilworth , D. Kutzarova , T. Oikhberg , B. Wallis This is my paper

classification 🧮 math.FA

keywords algorithmbasesgreedyweightedachieveaspectsbasisdescribe

0 comments

read the original 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).

This paper has not been read by Pith yet.

The weighted Property (A) and the greedy algorithm

discussion (0)