2000 character limit reached
On consecutive greedy and other greedy-like type of bases
Published 11 Feb 2023 in math.FA | (2302.05758v1)
Abstract: We continue our study of the Thresholding Greedy Algorithm when we restrict the vectors involved in our approximations so that they either are supported on intervals of $\mathbb N$ or have constant coefficients. We introduce and characterize what we call consecutive greedy bases and provide new characterizations of almost greedy and squeeze symmetric Schauder bases. Moreover, we investigate some cases involving greedy-like properties with constant 1 and study the related notion of Property (A,$\tau$).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.