Related papers: Sparse domination and the strong maximal function
In this note we give simple proofs of several results involving maximal truncated Calde\'on-Zygmund operators in the general setting of rearrangement invariant quasi-Banach function spaces by sparse domination. Our techniques allow us to…
We prove endpoint results for sparse domination of translation invariant multiscale operators. The results are formulated in terms of dilation invariant classes of Fourier multipliers based on natural localized $M^{p\to q}$ norms which…
We consider Upper Domination, the problem of finding the minimal dominating set of maximum cardinality. Very few exact algorithms have been described for solving Upper Domination. In particular, no binary programming formulations for Upper…
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that the distance-d dominating-set problem, also known as the…
We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a function of incomplete degree that dominates almost all degrees. This…
In finite problems comprising objects, situations, and an object- and situation-contingent payoff function, we study the comparative statics of the set of undominated objects, meaning those for which there exists no mixture over objects…
We define a condition called almost strict domination for pairs of representations $\rho_1:\pi_1(S_{g,n})\to \textrm{PSL}(2,\mathbb{R})$, $\rho_2:\pi_1(S_{g,n})\to G$, where $G$ is the isometry group of a Hadamard manifold $(X,\nu)$, and…
The dominating set problem and its generalization, the distance-$r$ dominating set problem, are among the well-studied problems in the sequential settings. In distributed models of computation, unlike for domination, not much is known about…
Using exclusively the localized estimates upon which the helicoidal method was built, we show how sparse estimates can also be obtained. This approach yields a sparse domination for multiple vector-valued extensions of operators as well. We…
We prove that bilinear forms associated to the rough homogeneous singular integrals $T_\Omega$ on $\mathbb R^d$, where the angular part $\Omega \in L^q (S^{d-1})$ has vanishing average and $1<q\leq \infty$, and to Bochner-Riesz means at the…
Dvorak (2013) gave a bound on the minimum size of a distance r dominating set in the terms of the maximum size of a distance 2r independent set and generalized coloring numbers, thus obtaining a constant factor approximation algorithm for…
We prove that scalar-valued sparse domination of a multilinear operator implies vector-valued sparse domination for tuples of quasi-Banach function spaces, for which we introduce a multilinear analogue of the UMD condition. This condition…
Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of…
We show that under rather general circumstances, the almost everywhere pointwise inequality $|f|(x) \le Mf (x)$ is equivalent to a weak form of the Lebesgue density theorem, for totally bounded closed sets. We derive both positive and…
We study the Riemannian distance function from a fixed point (a point-wise target) of Euclidean space in the presence of a compact obstacle bounded by a smooth hypersurface. First, we show that such a function is locally semiconcave with a…
Suppose that $S_1$ and $S_2$ are nonempty subsets of a complete metric space $(\mathcal{M},d)$ and $\phi,\psi:S_1\to S_2$ are mappings. The aim of this work is to investigate some conditions on $\phi$ and $\psi$ such that the two functions,…
In this paper, we study "robust" dominating sets of random graphs that retain the domination property even if a small \emph{deterministic} set of edges are removed. We motivate our study by illustrating with examples from wireless networks…
The k-domination number of a graph is the minimum size of a set X such that every vertex of G is in distance at most k from X. We give a linear time constant-factor approximation algorithm for k-domination number in classes of graphs with…
We study the domination of the lattice Hardy--Littlewood maximal operator by sparse operators in the setting of general Banach lattices. We prove that the admissible exponents of the dominating sparse operator are determined by the…
We prove a general sparse domination theorem in a space of homogeneous type, in which a vector-valued operator is controlled pointwise by a positive, local expression called a sparse operator. We use the structure of the operator to get…