arXiv subjects
Publications and source records attributed to 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. Concretely, we address and partially answer three open questions related to quasi-greedy bases for sequences with gaps posed in [15, Section 6].
In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. Since then, there have been many interesting and useful characterizations of greedy-type bases in Banach spaces. In this article, we study and extend several characterizations of greedy and almost greedy bases in the literature. Along the way, we give various examples to complement our main results. Furthermore, we propose a new version of the so-called Weak Thresholding Greedy Algorithm (WTGA) and show that the convergence of this new algorithm is equivalent to the convergence of the WTGA.
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 $k$, and find conditions under which the extended notions are equivalent their regular counterparts.
In 2003, S. J. Dilworth et al. ([8]) introduced the notion of almost-greedy (resp. partially-greedy) bases. These bases were characterized in terms of quasi-greediness and democracy (resp. conservativeness). In this paper we will show a new functional characterization of these type of bases in general Banach spaces following the spirit of the characterization of greediness proved in [5].
We continue with the study of greedy-type bases in quasi-Banach spaces started in [3]. In this paper, we study partially-greedy bases focusing our attention in two main results: -Characterization of partially-greedy bases in quasi-Banach spaces in terms of quasi-greediness and different conservative-like properties. -Given a $C$-partially-greedy basis in a quasi-Banach space, there exists a "renorming" such that the basis is $1$-partially-greedy.
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 Lebesgue-type parameters associated with them. We prove that this property is equivalent to that of being conservative and quasi-greedy, extending a similar result given in [9] for Schauder bases. We also give a characterization of 1-strong partial greediness, following the study started in [1,3].
We investigate properties of the $m$-th error of approximation by polynomials with constant coefficients $\mathcal{D}_{m}(x)$ and with modulus-constant coefficients $\mathcal{D}_{m}^{\ast}(x)$ introduced by Berná and Blasco (2016) to study greedy bases in Banach spaces. We characterize when $\liminf_{m}{\mathcal{D}_{m}(x)}$ and $\liminf_{m}{\mathcal{D}_{m}^*(x)}$ are equivalent to $\| x\|$ in terms of the democracy and superdemocracy functions, and provide sufficient conditions ensuring that $\lim_{m}{\mathcal{D}_{m}^*(x)} = \lim_{m}{\mathcal{D}_{m}(x)} = \| x\|$, extending previous very particular results.
One classical result in greedy approximation theory is that almost-greedy and semi-greedy bases are equivalent in the context of Schauder bases in Banach spaces with finite cotype. This result was proved by S. J. Dilworth, N. J. Kalton and D. Kutzarova in [7] and, recently, the first author in [2] proved that the condition of finite cotype can be removed in this result. In [11], the authors extend the notion of semi-greediness to the context of weights and proved the following: if w is a weight and $\mathcal B$ is a Schauder basis in a Banach space $\mathbb X$ with finite cotype, then w-semi-greediness and w-almost-greediness are equivalent notions. In this paper, we prove the same characterization but removing the condition of finite cotype and, also, we try to relax the condition of Schauder in the characterization of semi-greediness using the $ρ$-admissibility, notion introduced recently in [4].
We establish estimates for the Lebesgue parameters of the Chebyshev Weak Thresholding Greedy Algorithm in the case of general bases in Banach spaces. These generalize and slightly improve earlier results in [9], and are complemented with examples showing the optimality of the bounds. Our results also correct certain bounds recently announced in [18], and answer some questions left open in that paper.
In [3] it was proved that almost-greedy and semi-greedy bases are equivalent in the context of Banach spaces with finite cotype. In this paper we show this equivalence for general Banach spaces.
Our aim in this paper is to attain a sharp asymptotic estimate for the greedy constant $C_g[\mathcal{H}^{(p)},L_p]$ of the (normalized) Haar system $\mathcal{H}^{(p)}$ in $L_{p}[0,1]$ for $1<p<\infty$. We will show that the superdemocracy constant of $\mathcal{H}^{(p)}$ in $L_{p}[0,1]$ grows as $p^{\ast}=\max\{p,p/(p-1)\}$ as $p^*$ goes to $\infty$. Thus, since the unconditionality constant of $\mathcal{H}^{(p)}$ in $L_{p}[0,1]$ is $p^*-1$, the well-known general estimates for the greedy constant of a greedy basis obtained from the intrinsic features of greediness (namely, democracy and unconditionality) yield that $p^{\ast}\lesssim C_g[\mathcal{H}^{(p)},L_p]\lesssim (p^{\ast})^{2}$. Going further, we develop techniques that allow us to close the gap between those two bounds, establishing that, in fact, $C_g[\mathcal{H}^{(p)},L_p]\approx p^{\ast}$.
In this paper we show that that greedy bases can be defined as those where the error term using $m$-greedy approximant is uniformly bounded by the best $m$-term approximation with respect to polynomials with constant coefficients in the context of the weak greedy algorithm and weights.
We present various estimates for the Lebesgue constants of the thresholding greedy algorithm, in the case of general bases in Banach spaces. We show the optimality of these estimates in some situations. Our results recover and slightly improve various estimates appearing earlier in the literature.
We shall present a new characterization of greedy bases and 1-greedy bases in terms of certain functionals defined using distances to one dimensional subspaces generated by the basis. We also introduce a new property that unifies the notions of unconditionality and democracy and allows us to recover a better dependence on the constants.