Albiac Alesanco, Fernando José
Loading...
Email Address
person.page.identifierURI
Birth Date
Job Title
Last Name
Albiac Alesanco
First Name
Fernando José
person.page.departamento
Estadística, Informática y Matemáticas
person.page.instituteName
InaMat2. Instituto de Investigación en Materiales Avanzados y Matemáticas
ORCID
person.page.observainves
person.page.upna
Name
- Publications
- item.page.relationships.isAdvisorOfPublication
- item.page.relationships.isAdvisorTFEOfPublication
- item.page.relationships.isAuthorMDOfPublication
9 results
Search Results
Now showing 1 - 9 of 9
Publication Open Access Greedy approximation for biorthogonal systems in quasi-Banach spaces(Instytut Matematyczny, 2021) Albiac Alesanco, Fernando José; Ansorena, José L.; Berná, Pablo M.; Wojtaszczyk, Przemyslaw; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2; Estadística, Informática y MatemáticasThe general problem addressed in this work is the development of a systematic study of the thresholding greedy algorithm for general biorthogonal systems in quasi-Banach spaces from a functional-analytic point of view. If (Formula Presented) is a biorthogonal system in X then for each x ∈ X we have a formal expansion (Formula Presented). The thresholding greedy algorithm (with threshold ε > 0) applied to x is formally defined as (Formula Presented). The properties of this operator give rise to the different classes of greedy-type bases. We revisit the concepts of greedy, quasi-greedy, and almost greedy bases in this comprehensive framework and provide the (non-trivial) extensions of the corresponding characterizations of those types of bases. As a by-product of our work, new properties arise, and the relations among them are carefully discussed.Publication Open Access Democracy of quasi-greedy bases in p-Banach spaces with applications to the efficiency of the thresholding greedy algorithm in the hardy spaces Hp(Dd)(Cambridge University Press, 2023) Albiac Alesanco, Fernando José; Ansorena, José L.; Bello, Glenier; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2We use new methods, specific for non-locally convex quasi-Banach spaces, to investigate when the quasi-greedy bases of a -Banach space for 0 < p < p are democratic. The novel techniques we obtain permit to show in particular that all quasi-greedy bases of the Hardy Hp(D) space for 0 < p < 1 are democratic while, in contrast, no quasi-greedy basis of Hp(Dd) for d > 2 is, solving thus a problem that was raised in [7]. Applications of our results to other spaces of interest both in functional analysis and approximation theory are also provided.Publication Open Access Building highly conditional almost greedy and quasi-greedy bases in Banach spaces(Elsevier, 2019) Albiac Alesanco, Fernando José; Ansorena, José L.; Dilworth, S. J.; Kutzarova, Denka; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaIt is known that for a conditional quasi-greedy basis B in a Banach space X, the associated sequence (k(m)[B](m=1)(infinity) of its conditionality constants verifies the estimate k(m)[B] = O(log m) and that if the reverse inequality log m =O(k(m)[B]) holds then X is non-superreflexive. Indeed, it is known that a quasi-greedy basis in a superreflexive quasi-Banach space fulfils the estimate k(m)[B] =O(log m)(1-epsilon) for some epsilon > 0. However, in the existing literature one finds very few instances of spaces possessing quasi-greedy basis with conditionality constants "as large as possible." Our goal in this article is to fill this gap. To that end we enhance and exploit a technique developed by Dilworth et al. in [15] and craft a wealth of new examples of both non-superreflexive classical Banach spaces having quasi-greedy bases B with k(m)[B] = O(log m) and superreflexiye classical Banach spaces having for every epsilon > 0 quasi-greedy bases B with k(m)[B] = O(log m)(1-epsilon). Moreover, in most cases those bases will be almost greedy.Publication 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 MatematikaWe 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.Publication 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 PublikoaIn 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.Publication 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 MatematikaFor 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 0Publication Open Access Quasi-greedy bases in ℓp (0 < p < 1) are democratic(Elsevier, 2020) Albiac Alesanco, Fernando José; Ansorena, José L.; Wojtaszczyk, Przemyslaw; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2; Estadística, Informática y MatemáticasThe list of known Banach spaces whose linear geometry determines the (nonlinear) democracy functions of their quasi-greedy bases to the extent that they end up being democratic, reduces to c0, ℓ2, and all separable L1-spaces. Oddly enough, these are the only Banach spaces that, when they have an unconditional basis, it is unique. Our aim in this paper is to study the connection between quasi-greediness and democracy of bases in non-locally convex spaces. We prove that all quasi-greedy bases in ℓp for 0Publication 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 - INAMAT2We 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.Publication 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 PublikoaWe 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.