carpathian_2025_41_1_31_44 - copie

Approximation by polynomials with constant coefficients and the Thresholding Greedy Algorithm


M. Berasategui, P. M. Berná, D. González


Full PDF

carpathian_2025_41_1_31_44

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, P. M. Berná 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.