Greedy approximation algorithms for sparse collections

DOI10.5565/PUBLMAT6812411MaRDI QIDQ6187460zbMATH OpenOpenAlexFDO

Authors 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

Carleson sequencemaximal functionmultiparametersparse collection

Mathematics Subject Classification ID

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

Abstract: We describe a greedy algorithm that approximates the Carleson constant of a collection of general sets. The approximation has a logarithmic loss in a general setting, but is optimal up to a constant with only mild geometric assumptions. The constructive nature of the algorithm gives additional information about the almost-disjoint structure of sparse collections. As applications, we give three results for collections of axis-parallel rectangles in every dimension. The first is a constructive proof of the equivalence between Carleson and sparse collections, first shown by H"anninen. The second is a structure theorem proving that every collection $mathcalE$ can be partitioned into $mathcalO(N)$ sparse subfamilies where $N$ is the Carleson constant of $mathcalE$. We also give examples showing that such a decomposition is impossible when the geometric assumptions are dropped. The third application is a characterization of the Carleson constant involving only $L^{1,infty}$ estimates.

Recommendations

• Greedy approximation of characteristic functions
• Sparse approximation by greedy algorithms
• Greedy approximation
• Equivalence of sparse and Carleson coefficients for general sets
• Greedy algorithm with gaps

Cites work

• A geometric proof of the strong maximal theorem
• Classical and Multilinear Harmonic Analysis
• Dyadic harmonic analysis and weighted inequalities: the sparse revolution
• Equivalence of sparse and Carleson coefficients for general sets
• scientific article; zbMATH DE number 3740123 (Why is no real title available?)
• Imbedding and multiplier theorems for discrete Littlewood-Paley spaces
• Intuitive dyadic calculus: the basics
• On projections in \(L_1\)
• Strong Differentiation with Respect to Measures

Cited in

(3)

• Weighted L^p L^q-boundedness of commutators and paraproducts in the Bloom setting
• Sharp restricted weak-type estimates for sparse operators
• Letter to the editor. Optimization algorithms for Carleson and sparse collections of sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187460)