Strong Partially Greedy Bases with Respect to an Arbitrary Sequence

From MaRDI portal
Publication:6407909

arXiv2208.07300MaRDI QIDQ6407909FDOQ6407909


Authors: Hùng Viẹt Chu Edit this on Wikidata


Publication date: 10 August 2022

Abstract: For Schauder bases, Dilworth et al. introduced and characterized the partially greedy property, which is strictly weaker than the (almost) greedy property. Later, Berasategui et al. defined and studied the strong partially greedy property for general bases. Let mathbfn be any strictly increasing sequence of positive integers. In this paper, we define the strong partially greedy property with respect to mathbfn, called the (mathbfn, strong partially greedy) property. We give characterizations of this new property, study relations among (mathbfn, strong partially greedy) properties for different sequences mathbfn, establish Lebesgue-type inequalities for the (mathbfn, strong partially greedy) parameter, investigate (mathbfn, strong partially greedy) bases with gaps, and weighted (mathbfn, strong partially greedy) bases, to name a few. Furthermore, we introduce the (mathbfn, almost greedy) property and equate the property to a strengthening of the (mathbfn, strong partially greedy) property. This paper can be viewed both as a survey of recent results regarding strong partially greedy bases and as a natural and nontrivial extension of these results to an arbitrary sequence instead of mathbbN.













This page was built for publication: Strong Partially Greedy Bases with Respect to an Arbitrary Sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407909)