Approximation by polynomials with constant coefficients and the Thresholding Greedy Algorithm
Functional Analysis
2023-11-21 v3
Abstract
Greedy bases are those bases where the Thresholding Greedy Algorithm (introduced by S. V. Konyagin and V. N. Temlyakov) produces the best possible approximation up to a constant. In 2017, Bern\'a and Blasco gave a characterization of these bases using polynomials with constant coefficients. In this paper, we continue this study improving some optimization problems and extending some results to the context of quasi-Banach spaces.
Cite
@article{arxiv.2309.14607,
title = {Approximation by polynomials with constant coefficients and the Thresholding Greedy Algorithm},
author = {Miguel Berasategui and Pablo M. Berná and David González},
journal= {arXiv preprint arXiv:2309.14607},
year = {2023}
}
Comments
corrected some typos