Artículo
Elton's near unconditionality of bases as a threshold-free form of greediness
Fecha de publicación:
10/2023
Editorial:
Academic Press Inc Elsevier Science
Revista:
Journal of Functional Analysis
ISSN:
0022-1236
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
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.
Palabras clave:
NEARLY UNCONDITIONAL BASES
,
THRESHOLDING GREEDY ALGORITHM
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos(IMAS)
Articulos de INSTITUTO DE INVESTIGACIONES MATEMATICAS "LUIS A. SANTALO"
Articulos de INSTITUTO DE INVESTIGACIONES MATEMATICAS "LUIS A. SANTALO"
Citación
Albiac, Fernando; Ansorena, José L.; Berasategui, Miguel Hernán; Elton's near unconditionality of bases as a threshold-free form of greediness; Academic Press Inc Elsevier Science; Journal of Functional Analysis; 285; 7; 10-2023; 1-22
Compartir
Altmétricas