Sparse domination and the strong maximal function

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