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 extend some of the notions that appear naturally in connection with these algorithms to the context of sequences with gaps. In particular, we will consider sequences of natural numbers for which the inequality $n_{k+1}\le \C n_{k}$ or $n_{k+1}\le \C+n_k$ holds for a positive constant $\C$ and all , and find conditions under which the extended notions are equivalent their regular counterparts.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.