Open Access
Unconditional and quasi-greedy bases in L-p with applications to Jacobi polynomials Fourier series
(European Mathematical Society, 2019) Albiac Alesanco, Fernando José; Ansorena, José L.; Ciaurri, Óscar; Varona, Juan L.; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
We show that the decreasing rearrangement of the Fourier series with respect to the Jacobi polynomials for functions in L-p does not converge unless p = 2. As a by-product of our work on quasi-greedy bases in L-p(µ), we show that no normalized unconditional basis in L-p, p not equal 2, can be semi-normalized in L-q for q not equal p, thus extending a classical theorem of Kadets and Pelczynski from 1968.
Open Access
Linear versus nonlinear forms of partial unconditionality of bases
(Elsevier, 2024-07-22) Albiac Alesanco, Fernando José; Ansorena, José L.; Berasategui, Miguel; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
The main results in this paper contribute to bringing to the fore novel underlying connections between the contemporary concepts and methods springing from greedy approximation theory with the well-established techniques of classical Banach spaces. We do that by showing that bounded-oscillation unconditional bases, introduced by Dilworth et al. in 2009 in the setting of their search for extraction principles of subsequences verifying partial forms of unconditionality, are the same as truncation quasi-greedy bases, a new breed of bases that appear naturally in the study of the performance of the thresholding greedy algorithm in Banach spaces. We use this identification to provide examples of bases that exhibit that bounded-oscillation unconditionality is a stronger condition than Elton's near unconditionality. We also take advantage of our arguments to provide examples that allow us to tell apart certain types of bases that verify either debilitated unconditionality conditions or weaker forms of quasi-greediness in the context of abstract approximation theory.
Open Access
Bidemocratic bases and their connections with other greedy-type bases
(Springer, 2023) Albiac Alesanco, Fernando José; Ansorena, José L.; Berasategui, Miguel; Berná, Pablo M.; Lassalle, Silvia; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
In nonlinear greedy approximation theory, bidemocratic bases have traditionally played the role of dualizing democratic, greedy, quasi-greedy, or almost greedy bases. In this article we shift the viewpoint and study them for their own sake, just as we would with any other kind of greedy-type bases. In particular we show that bidemocratic bases need not be quasi-greedy, despite the fact that they retain a strong unconditionality flavor which brings them very close to being quasi-greedy. Our constructive approach gives that for each 1 < p < infinity the space L-p has a bidemocratic basis which is not quasi-greedy. We also present a novel method for constructing conditional quasi-greedy bases which are bidemocratic, and provide a characterization of bidemocratic bases in terms of the new concepts of truncation quasi-greediness and partially demo-cratic bases.
Open Access
Elton's near unconditionality of bases as a threshold-free form of greediness
(Elsevier, 2023) Albiac Alesanco, Fernando José; Ansorena, José L.; Berasategui, Miguel; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2
Elton'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 make a contribution to the isometric theory of greedy bases by characterizing those bases that are 1-quasi-greedy for largest coefficients.
Embargo
Twenty-five years of greedy bases
(Elsevier, 2025-05-01) Albiac Alesanco, Fernando José; Ansorena, José L.; Temlyakov, Vladimir; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2
Although the basic idea behind the concept of a greedy basis had been around for some time, the formal development of a theory of greedy bases was initiated in 1999 with the publication of the article [S.V. Konyagin and V.N. Temlyakov, A remark on greedy approximation in Banach spaces, East J. Approx. 5 (3) (1999), 365-379]. The theoretical simplicity of the thresholding greedy algorithm became a model for a procedure widely used in numerical applications and the subject of greedy bases evolved very rapidly from the point of view of approximation theory. The idea of studying greedy bases and related greedy algorithms attracted also the attention of researchers with a classical Banach space theory background. From the more abstract point of functional analysis, the theory of greedy bases and its derivates evolved very fast as many fundamental results were discovered and new ramifications branched out. Hundreds of papers on greedy-like bases and several monographs have been written since the appearance of the aforementioned foundational paper. After twenty-five years, the theory is very much alive and it continues to be a very active research topic both for functional analysts and for researchers interested in the applied nature of nonlinear approximation alike. This is why we believe it is a good moment to gather a selection of 25 open problems (one per year since 1999!) whose solution would contribute to advance the state of art of this beautiful topic.
Open Access
Conditional quasi-greedy bases in non-superreflexive Banach spaces
(Springer, 2019) Albiac Alesanco, Fernando José; Ansorena, José L.; Wojtaszczyk, Przemyslaw; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
For a conditional quasi-greedy basis B in a Banach space, the associated conditionality constants km[B] verify the estimate km[B]=O(logm). Answering a question raised by Temlyakov, Yang, and Ye, several authors have studied whether this bound can be improved when we consider quasi-greedy bases in some special class of spaces. It is known that every quasi-greedy basis in a superreflexive Banach space verifies km[B]=O((logm)1-E) for some 0
Open Access
Weak forms of unconditionality of bases in greedy approximation
(Instytut Matematyczny, 2022) Albiac Alesanco, Fernando José; Ansorena, José L.; Berasategui, Miguel; Berná, Pablo M.; Lassalle, Silvia; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2
We study a new class of bases, weaker than quasi-greedy bases, which retain their unconditionality properties and can provide the same optimality for the thresholding greedy algorithm. We measure how far these bases are from being unconditional and use this concept to give a new characterization of nearly unconditional bases.
Open Access
Sparse approximation using new greedy-like bases in superreflexive spaces
(Instytut Matematyczny, 2023) Albiac Alesanco, Fernando José; Ansorena, José L.; Berasategui, Miguel; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2
This paper is devoted to theoretical aspects of optimality of sparse approximation. We undertake a quantitative study of new types of greedy-like bases that have recently arisen in the context of non-linear m-term approximation in Banach spaces as a generalization of the properties that characterize almost greedy bases, i.e., quasi-greediness and democracy. As a means to compare the efficiency of these new bases with already existing ones in regard to the implementation of the Thresholding Greedy Algorithm, we place emphasis on obtaining estimates for their sequence of unconditionality parameters. Using an enhanced version of the original Dilworth-Kalton-Kutzarova method (2003) for building almost greedy bases, we manage to construct bidemocratic bases whose unconditionality parameters satisfy significantly worse estimates than almost greedy bases even in Hilbert spaces.
Open Access
Counterexamples in isometric theory of symmetric and greedy bases
(Elsevier, 2024) Albiac Alesanco, Fernando José; Ansorena, José L.; Blasco, Óscar; Chu, Hùng Việt; Oikhberg, Timur; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
We continue the study initiated in Albiac and Wojtaszczyk (2006) of properties related to greedy bases in the case when the constants involved are sharp, i.e., in the case when they are equal to 1. Our main goal here is to provide an example of a Banach space with a basis that satisfies Property (A) but fails to be 1-suppression unconditional, thus settling Problem 4.4 from Albiac and Ansorena (2017). In particular, our construction demonstrates that bases with Property (A) need not be 1-greedy even with the additional assumption that they are unconditional and symmetric. We also exhibit a finite-dimensional counterpart of this example, and show that, at least in the finite-dimensional setting, Property (A) does not pass to the dual. As a by-product of our arguments, we prove that a symmetric basis is unconditional if and only if it is total, thus generalizing the well-known result that symmetric Schauder bases are unconditional.
Open Access
Existence of almost greedy bases in mixed-norm sequence and matrix spaces, including besov spaces
(Springer, 2023) Albiac Alesanco, Fernando José; Ansorena, José L.; Bello, Glenier; Wojtaszczyk, Przemyslaw; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
We prove that the sequence spaces lp ⊕ lq and the spaces of infinite matrices lp(lq ), lq l(p) and ( ∞ n=1 n lp)lq , which are isomorphic to certain Besov spaces, have an almost greedy basis whenever 0 < p < 1 < q < ∞. More precisely, we custom-build almost greedy bases in such a way that the Lebesgue parameters grow in a prescribed manner. Our arguments critically depend on the extension of the Dilworth–Kalton– Kutzarova method from Dilworth et al. (Stud Math 159(1):67–101, 2003), which was originally designed for constructing almost greedy bases in Banach spaces, to make it valid for direct sums of mixed-normed spaces with nonlocally convex components. Additionally, we prove that the fundamental functions of all almost greedy bases of these spaces grow as (ml/q )∞ m=l.