Related papers: Sparse domination and the strong maximal function
The power dominating set (PDS) problem is the following extension of the well-known dominating set problem: find a smallest-size set of nodes $S$ that power dominates all the nodes, where a node $v$ is power dominated if (1) $v$ is in $S$…
We introduce a new sparse $T1$ theorem that estimates the dual pair associated with a Calderon-Zygmund operator by a sub-bilinear form supported on a sparse family of cubes. The main result in the paper improves previous sparse $T1$…
Inspired by the potential of improving tractability via gap- or above-guarantee parametrisations, we investigate the complexity of Dominating Set when given a suitable lower-bound witness. Concretely, we consider being provided with a…
The aim of this paper is to show that the discrete maximal function $$\mathcal{M}_{h}f(x)=\sup_{N\in\mathbb{N}}\frac{1}{|\mathbf{N}_{h}\cap[1, N]|}\Big|\sum_{n\in \mathbf{N}_{h}\cap[1, N]}f(x-n)\Big|,\ \ \mbox{for $x\in\mathbb{Z}$},$$ is of…
The domination polynomial D(G,x) is the ordinary generating function for the dominating sets of an undirected graph G=(V,E) with respect to their cardinality. We consider in this paper representations of D(G,x) as a sum over subsets of the…
We prove that the class of convolution-type kernels satisfying suitable decay conditions of the Fourier transform, appearing in the works of Christ, Christ-Rubio de Francia, and Duoandikoetxea-Rubio de Francia gives rise to maximally…
We investigate the convergence of an application of a proximal gradient method to control problems with nonsmooth and nonconvex control cost. Here, we focus on control cost functionals that promote sparsity, which includes functionals of…
Due to its nonlocal nature, the $r$-variation norm Carleson operator $C_r$ does not yield to the sparse domination techniques of Lerner, Di Plinio and Lerner, Lacey. We overcome this difficulty and prove that the dual form to $C_r$ can be…
We quantify the large deviations of Gaussian extreme value statistics on closed convex sets in d-dimensional Euclidean space. The asymptotics imply that the extreme value distribution exhibits a rate function that is a simple quadratic…
In this paper, we investigate the strong maximum principle for generalized solutions of Monge-Amp\`ere type equations. We prove that the strong maximum principle holds at points where the function is strictly convex but not necessarily…
We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of…
This paper discusses a distance guarding concept on triangulation graphs, which can be associated with distance domination and distance vertex cover. We show how these subjects are interconnected and provide tight bounds for any n-vertex…
The maximum principle for optimal control problems of fully coupled forward-backward doubly stochastic differential equations (FBDSDEs in short) in the global form is obtained, under the assumptions that the diffusion coefficients do not…
We shall consider a stochastic maximum principle of optimal control for a control problem associated with a stochastic partial differential equations of the following type: d x(t) = (A(t) x(t) + a (t, u(t)) x(t) + b(t, u(t)) dt +…
An integer distance digraph is the Cayley graph $\Gamma(\mathbb{Z},S)$ of the additive group $\mathbb{Z}$ of all integers with respect to a finite subset $S\subseteq\mathbb{Z}$. The domination ratio of $\Gamma(\mathbb{Z},S)$, defined as the…
We present polynomial-time approximation schemes based on local search} technique for both geometric (discrete) independent set (\mdis) and geometric (discrete) dominating set (\mdds) problems, where the objects are arbitrary radii disks…
This article is concerned with finite rank stability theory, and more precisely two classical ways to decompose a type using minimal types. The first is its domination equivalence to a Morley power of minimal types, and the second its…
A set $D$ of vertices of a simple graph $G=(V,E)$ is a strong dominating set, if for every vertex $x\in \overline{D}=V\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x)\leq deg(y)$. The strong domination number…
We study a family of generalizations of Edge Dominating Set on directed graphs called Directed $(p,q)$-Edge Dominating Set. In this problem an arc $(u,v)$ is said to dominate itself, as well as all arcs which are at distance at most $q$…
A digraph $D$ is an efficient closed domination digraph if there exists a subset $S$ of $V(D)$ for which the closed out-neighborhoods centered in vertices of $S$ form a partition of $V(D)$. In this work we deal with efficient closed…