The best m-term approximation with respect to polynomials with constant coefficients
arXiv:1606.07250
Abstract
In this paper we show that that greedy bases can be defined as those where the error term using -greedy approximant is uniformly bounded by the best -term approximation with respect to polynomials with constant coefficients in the context of the weak greedy algorithm and weights.
12 pages