Add to ORKGElton's near unconditionality and quasi-greediness for largest coefficients are two properties of bases that made their appearance in functional analysis from very different areas of research. One of our aims in this note is to show that, oddly enough, they are connected to the extent that they are equivalent notions. We take advantage of this new description of the former property to further the study of the threshold function associated with near unconditionality. Finally, we made a contribution to the isometric theory of greedy bases by characterizing those bases that are $1$-quasi-greedy for largest coefficients
AbstractA basis for a Banach space X is greedy if and only if the greedy algorithm provides, up to a...
Tsirelson's space $\mathcal{T}$ made its appearance in Banach space theory in 1974 soon to become on...
We show that the decreasing rearrangement of the Fourier series with respect to the Jacobi polynomia...
Elton's near unconditionality and quasi-greediness for largest coefficients are two properties of ba...
We study a new class of bases, weaker than quasi-greedy bases, which retain their unconditionality p...
Let $X$ be a Banach space and $(e_n)_{n=1}^\infty$ be a basis. For a fixed function $f$ in a certain...
It is known that for a conditional quasi-greedy basis B in a Banach space X, the associated sequence...
The general problem addressed in this work is the development of a systematic study of the threshold...
The list of known Banach spaces whose linear geometry determines the (nonlinear) democracy functions...
In \cite{O2015}, T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithm...
This is a post-peer-review, pre-copyedit version of an article published in Constr Approx (2019) 49:...
In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. ...
The final publication is available at Springer via http://dx.doi.org/10.1007/s00365-013-9209-zWe sho...
This paper is devoted to theoretical aspects on optimality of sparse approximation. We undertake a q...
We construct for each 0<p≤1 an infinite collection of subspaces of ℓp that extend the example of Lin...
AbstractA basis for a Banach space X is greedy if and only if the greedy algorithm provides, up to a...
Tsirelson's space $\mathcal{T}$ made its appearance in Banach space theory in 1974 soon to become on...
We show that the decreasing rearrangement of the Fourier series with respect to the Jacobi polynomia...
Elton's near unconditionality and quasi-greediness for largest coefficients are two properties of ba...
We study a new class of bases, weaker than quasi-greedy bases, which retain their unconditionality p...
Let $X$ be a Banach space and $(e_n)_{n=1}^\infty$ be a basis. For a fixed function $f$ in a certain...
It is known that for a conditional quasi-greedy basis B in a Banach space X, the associated sequence...
The general problem addressed in this work is the development of a systematic study of the threshold...
The list of known Banach spaces whose linear geometry determines the (nonlinear) democracy functions...
In \cite{O2015}, T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithm...
This is a post-peer-review, pre-copyedit version of an article published in Constr Approx (2019) 49:...
In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. ...
The final publication is available at Springer via http://dx.doi.org/10.1007/s00365-013-9209-zWe sho...
This paper is devoted to theoretical aspects on optimality of sparse approximation. We undertake a q...
We construct for each 0<p≤1 an infinite collection of subspaces of ℓp that extend the example of Lin...
AbstractA basis for a Banach space X is greedy if and only if the greedy algorithm provides, up to a...
Tsirelson's space $\mathcal{T}$ made its appearance in Banach space theory in 1974 soon to become on...
We show that the decreasing rearrangement of the Fourier series with respect to the Jacobi polynomia...