2 citations · 3 across the 19 of their papers we have counts for
4 papers · 1 filter
Greedy-like bases for sequences with gaps
Miguel Berasategui, Pablo M. Berná
In [25], T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithms for sequences with gaps, with a focus on the --quasi-greedy property tha…
Quasi-greedy bases for sequences with gaps
Miguel Berasategui, Pablo M. Berná
In this paper, we establish new advances in the theory started by T. Oikhberg in [15] where the author joins greedy approximation theory with the use of sequences with gaps. Concre…
Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
Miguel Berasategui, Silvia Lassalle
We introduce and study the notion of weak semi-greedy systems -which is inspired in the concepts of semi-greedy and Branch semi-greedy systems and weak thresholding sets-, and prov…
Strong partially greedy bases and Lebesgue-type inequalities
Miguel Berasategui, Pablo M. Berná, Silvia Lassalle
In this paper we continue the study of Lebesgue-type inequalities for greedy algorithms. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesgu…