2000 character limit reached
Greedy approximation for biorthogonal systems in quasi-Banach spaces
Published 27 Mar 2019 in math.FA | (1903.11651v1)
Abstract: The general problem addressed in this work is the development of a systematic study of the thresholding greedy algorithm for general biorthogonal systems (also known as Markushevich bases) in quasi-Banach spaces from a functional-analytic point of view. We revisit the concepts of greedy, quasi-greedy, and almost greedy bases in this comprehensive framework and provide the (nontrivial) extensions of the corresponding characterizations of those types of bases. As a by-product of our work, new properties arise, and the relations amongst them are carefully discussed.
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.