3 papers
math.CA2022
Greedy approximation algorithms for sparse collections
Guillermo Rey
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 optima…
math.CA2020
Another counterexample to Zygmund's conjecture
Guillermo Rey
We present a simple dyadic construction that yields a new counterexample to Zygmund's conjecture. Our result recovers Soria's classical result in dimension three, through a differe…
math.CA2018
Sparse domination and the strong maximal function
Alex Barron, Jose M. Conde-Alonso, Yumeng Ou +1
We study the problem of dominating the dyadic strong maximal function by -type sparse forms based on rectangles with sides parallel to the axes, and show that such dominati…