Greedy-like bases for sequences with gaps

From MaRDI portal



Abstract: In cite{O2015}, T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithms for sequences with gaps. In this paper, we continue the study of -quasi-greedy bases, and prove that for with bounded quotient gaps, -quasi-greedy bases are quasi-greedy generalizing the result proved in cite{BB} to the context of Markushevich bases. Additionally, we extend to this context and study several greedy-like properties.




Cites work









This page was built for publication: Greedy-like bases for sequences with gaps

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