Related papers: Sparse domination and the strong maximal function

We extend Lerner's recent approach to sparse domination of Calder\'on--Zygmund operators to upper doubling (but not necessarily doubling), geometrically doubling metric measure spaces. Our domination theorem is different from the one…

In this paper, we study maximal functions along some finite type curves and hypersurfaces. In particular, various impacts of non-isotropic dilations are considered. Firstly, we provide a generic scheme that allows us to deduce the sparse…

Let $S$ be the dyadic bi-parameter square function $$Sf(x)^{2} = \sum_{R \in \mathcal{D}} |\langle f, h_{R} \rangle|^{2} \frac{1_{R}(x)}{|R|}.$$ We prove that if $T$ is a bi-parameter martingale transform and $f,g$ are suitable test…

In this paper we refine the recent sparse domination of the integrated $p = 2$ matrix weighted dyadic square function by T. Hytonen, S. Petermichl, and A. Volberg to prove a pointwise sparse domination of general matrix weighted dyadic…

We prove that the maximal functions associated with a Zygmund dilation dyadic structure in three-dimensional Euclidean space, and with the flag dyadic structure in two-dimensional Euclidean space, cannot be bounded by multiparameter sparse…

We present a general approach to sparse domination based on single-scale $L^p$-improving as a key property. The results are formulated in the setting of metric spaces of homogeneous type and avoid completely the use of dyadic-probabilistic…

We prove a bilinear form sparse domination theorem that applies to many multi-scale operators beyond Calder\'on-Zygmund theory, and also establish necessary conditions. Among the applications, we cover large classes of Fourier multipliers,…

We present a general sparse domination principle which respects the cancellative structure of the functions under study. We obtain sparse domination results in general measure spaces, including general martingale settings in one and two…

We prove sharp weighted estimates for the non-tangential maximal function of singular integrals mapping functions from $\mathbf{R}^n$ to the half-space in $\mathbf{R}^{1+n}$ above $\mathbf{R}^n$. The proof is based on pointwise sparse…

We develop the self similarity argument known as sparse domination in an abstract martingale setting, using a continuous time parameter. With this method, we prove a sharp weighted L^p estimate for the maximal operator Y^* of Y with respect…

We present a fundamentally new proof of the dimensionless Lp boundedness of the Bakry Riesz vector on manifolds with bounded geometry. Our proof has the significant advantage that it allows for a much stronger conclusion than previous…

We prove a quadratic sparse domination result for general non-integral square functions $S$. That is, we prove an estimate of the form \begin{equation*} \int_{M} (S f)^{2} g \, \mathrm{d}\mu \le c \sum_{P \in \mathcal{S}}…

We obtain an improved version of the pointwise sparse domination principle established by the first author in [19]. This allows us to determine nearly minimal assumptions on a singular integral operator $T$ for which it admits a sparse…

Using the Calder\'on-Zygmund decomposition, we give a novel and simple proof that $L^2$ bounded dyadic shifts admit a domination by positive sparse forms with linear growth in the complexity of the shift. Our estimate, coupled with…

In this expository article, we briefly survey the main known schemes of proof of sparse domination principles within harmonic analysis. We then use the one based on the Calder\'on-Zygmund decomposition to prove a dual sparse domination…

Rubalcaba and Slater (Robert R. Rubalcaba and Peter J. Slater. Efficient (j,k)-domination. Discuss. Math. Graph Theory, 27(3):409-423, 2007.) define a $(j,k)$-dominating function on graph $X$ as a function $f:V(X)\rightarrow \{0,\ldots,j\}$…

The goal of this expository paper is to give a self-contained introduction to sparse domination. This is a method relying on techniques from dyadic Harmonic Analysis which has received a lot of attention in recent years. Essentially, it…

Rectangles are used to approximate objects, or sets of objects, in a plethora of applications, systems and index structures. Many tasks, such as nearest neighbor search and similarity ranking, require to decide if objects in one rectangle A…

We provide a versatile formulation of Lacey's recent sparse pointwise domination technique with a local weak type estimate on a nontangential maximal function as the only hypothesis. We verify this hypothesis for sharp variational…

The study of domination in graphs has led to a variety of domination problems studied in the literature. Most of these follow the following general framework: Given a graph $G$ and an integer $k$, decide if there is a set $S$ of $k$…