A note on 1-semi-greedy bases in p-Banach spaces with 0 < p ≤ 1
Open Access
- 1 January 2024
- journal article
- research article
- Published by Walter de Gruyter GmbH in Demonstratio Mathematica
- Vol. 57 (1)
Abstract
The purpose of this article is to discuss about the so-called semi-greedy bases in -Banach spaces. Specifically, we will review existing results that characterize these bases in terms of almost-greedy bases, and, also, we analyze quantitatively the behavior of certain constants. As new results, by avoiding the use of certain classical results in -convexity, we aim to quantitatively improve specific bounds for bi-monotone 1-semi-greedy bases.
Keywords
This publication has 15 references indexed in Scilit:
- Greedy-like bases for sequences with gapsBanach Journal of Mathematical Analysis, 2024
- Weak Greedy Algorithms and the Equivalence Between Semi-greedy and Almost Greedy Markushevich BasesJournal of Fourier Analysis and Applications, 2023
- Function Classes on the Unit Disc2019
- Equivalence between almost-greedy and semi-greedy basesJournal of Mathematical Analysis and Applications, 2019
- Lebesgue inequalities for the greedy algorithm in general basesRevista Matemática Complutense, 2017
- Lebesgue-Type Inequalities for Quasi-greedy BasesConstructive Approximation, 2013
- Characterization of 1-greedy basesJournal of Approximation Theory, 2006
- The Thresholding Greedy Algorithm, Greedy Bases, and DualityConstructive Approximation, 2003
- Greedy Algorithm for General Biorthogonal SystemsJournal of Approximation Theory, 2000
- Locally bounded linear topological spacesProceedings of the Japan Academy, Series A, Mathematical Sciences, 1942