2022/08/28 by Hùng Việt Chu, Chu, Hung Viet · 1 citation
Computer Science · Mathematics · #41A65 #46B15 #Complexity and Algorithms in Graphs #Computability, Logic, AI Algorithms #FOS: Mathematics #Functional Analysis (math.FA) #Rings, Modules, and Algebras
paper · pdf · doi:10.48550/arxiv.2208.13291
openalex publication_date 2022/08/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
An interesting result due to Dilworth et al. was that if we enlarge greedy sums by a constant factor λ> 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 λ 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.