Publication:
Elton's near unconditionality of bases as a threshold-free form of greediness

Date

2023

Authors

Ansorena, José L.
Berasategui, Miguel

Director

Publisher

Elsevier
Acceso abierto / Sarbide irekia
Artículo / Artikulua
Versión publicada / Argitaratu den bertsioa

Project identifier

AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-107701GB-I00/ES/recolecta

Abstract

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.

Description

Keywords

Nearly unconditional bases, Thresholding greedy algorithm

Department

Estadística, Informática y Matemáticas / Estatistika, Informatika eta Matematika / Institute for Advanced Materials and Mathematics - INAMAT2

Faculty/School

Degree

Doctorate program

item.page.cita

Albiac, F., Ansorena, J. L., & Berasategui, M. (2023). Elton’s near unconditionality of bases as a threshold-free form of greediness. Journal of Functional Analysis, 285(7), 110060. https://doi.org/10.1016/j.jfa.2023.110060

item.page.rights

© 2023 The Author(s). This is an open access article under the CC BY license

Los documentos de Academica-e están protegidos por derechos de autor con todos los derechos reservados, a no ser que se indique lo contrario.