2000 character limit reached
A functional characterization of almost greedy and partially greedy bases
Published 3 Aug 2021 in math.FA | (2108.01399v1)
Abstract: In 2003, S. J. Dilworth et al. ([8]) introduced the notion of almost-greedy (resp. partially-greedy) bases. These bases were characterized in terms of quasi-greediness and democracy (resp. conservativeness). In this paper we will show a new functional characterization of these type of bases in general Banach spaces following the spirit of the characterization of greediness proved in [5].
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.