Larger Greedy Sums for Reverse Partially Greedy Bases

DOI10.1007/S10476-024-00008-XarXiv2208.13291MaRDI QIDQ6409075FDOQ6409075

Authors: Hêng Việt Chu 

Publication date: 28 August 2022

Abstract: An interesting result due to Dilworth et al. was that if we enlarge greedy sums by a constant factor $lambda>1$ in the condition defining the greedy property, then we obtain an equivalence of the almost greedy property, a strictly weaker property. Previously, the author of the present paper showed that enlarging greedy sums by $lambda$ in the condition defining the partially greedy (PG) property also strictly weakens the property. However, enlarging greedy sums in the definition of reverse partially greedy (RPG) bases by Dilworth and Khurana again gives RPG bases. The companion of PG and RPG bases suggests the existence of a characterization of RPG bases which, when greedy sums are enlarged, gives an analog of a result that holds for partially greedy bases. In this paper, we show that such a characterization indeed exists, answering positively a question previously posed by the author.

Recommendations

• Extensions and new characterizations of some greedy-type bases
• Performance of the thresholding greedy algorithm with larger greedy sums
• Characterizations of almost greedy and partially greedy bases
• Weight-partially greedy bases and weight-property \((A)\)

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)

Cited In (1)

• The thresholding greedy algorithm versus approximations with sizes bounded by certain functions \(f\)

This page was built for publication: Larger Greedy Sums for Reverse Partially Greedy Bases

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