Sparse domination and the strong maximal function

Alex Barron, José M. Conde-Alonso, Yumeng Ou, Guillermo Rey

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

We study the problem of dominating the dyadic strong maximal function by (1,1)-type sparse forms based on rectangles with sides parallel to the axes, and show that such domination is impossible. Our proof relies on an explicit construction of a pair of maximally separated point sets with respect to an appropriately defined notion of distance.

Original languageEnglish (US)
Pages (from-to)1-26
Number of pages26
JournalAdvances in Mathematics
Volume345
DOIs
StatePublished - Mar 17 2019

Bibliographical note

Funding Information:
The authors would like to thank Jill Pipher and Dmitriy Bilyk for useful discussions regarding the content of this paper. The third named author is supported by NSF-DMS #1764454.

Publisher Copyright:
© 2019 Elsevier Inc.

Keywords

  • Biparameter
  • Maximal functions
  • Multiparameter
  • Sparse domination

Fingerprint

Dive into the research topics of 'Sparse domination and the strong maximal function'. Together they form a unique fingerprint.

Cite this