Greedy approximation algorithms for sparse collections

DOI10.5565/publmat6812411zbMath1530.42033arXiv2202.10267OpenAlexW4390007843MaRDI QIDQ6187460

Guillermo Rey

Publication date: 15 January 2024

Published in: Publicacions Matemàtiques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.10267

zbMATH Keywords

maximal functionCarleson sequencemultiparametersparse collection

Mathematics Subject Classification ID

Spaces of measurable functions ((L^p)-spaces, Orlicz spaces, Köthe function spaces, Lorentz spaces, rearrangement invariant spaces, ideal spaces, etc.) (46E30) Maximal functions, Littlewood-Paley theory (42B25) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• On projections in \(L_1\)
• A geometric proof of the strong maximal theorem
• Equivalence of sparse and Carleson coefficients for general sets
• Imbedding and multiplier theorems for discrete Littlewood-Paley spaces
• Intuitive dyadic calculus: the basics
• Dyadic Harmonic Analysis and Weighted Inequalities: The Sparse Revolution
• Strong Differentiation with Respect to Measures
• Classical and Multilinear Harmonic Analysis

This page was built for publication: Greedy approximation algorithms for sparse collections