Lower-order refinements of greedy approximation
Kevin Beanland, Hùng Việt Chu, Thomas Schlumprecht, András Zsák · Studia Mathematica · 2026
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
Studia Mathematica · Polish Academy of Sciences · article · 2026
Abstract
For two countable ordinals α and β, a basis of a Banach space X is said to be (α,β)-quasi-greedy if it is ∙ quasi-greedy, ∙ Sα-unconditional but not Sα+1-unconditional, and ∙ Sβ-democratic but not Sβ+1-democratic. If α or β is replaced with ∞, then the basis is required to be unconditonal or democratic, respectively. Previous work constructed a (0,0)-quasi-greedy basis, an (α,∞)-quasi-greedy basis, and an (∞,α)-quasi-greedy basis. In this paper, we construct (α,β)-quasi-greedy bases for β≤α+1 (except the already solved case α=β=0).
Open the resolved locator · 10.4064/sm250412-2-10
Metadata licence: OpenAlex metadata (CC0)