
arXiv: 2309.14607
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´a and ´O. 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.
Mathematics - Functional Analysis, Abstract approximation theory (approximation in normed linear spaces and other abstract spaces), unconditional bases, Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces, FOS: Mathematics, greedy bases, Functional Analysis (math.FA), 46B15
Mathematics - Functional Analysis, Abstract approximation theory (approximation in normed linear spaces and other abstract spaces), unconditional bases, Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces, FOS: Mathematics, greedy bases, Functional Analysis (math.FA), 46B15
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
