Related papers: Sparse domination and the strong maximal function
In this paper we consider the maximum principle of optimal control for a stochastic control problem. This problem is governed by a system of fully coupled multi-dimensional forward-backward doubly stochastic differential equation with…
This paper is concerned with a shape optimization problem governed by a non-smooth PDE, i.e., the nonlinearity in the state equation is not necessarily differentiable. We follow the functional variational approach of [40] where the set of…
In this paper, we obtain the exact values of several domination parameters for the direct product of a complete graph with a path or a cycle. Specifically, we determine the domination number, independent domination number,…
A general maximum principle (necessary and sufficient conditions) for an optimal control problem governed by a stochastic differential equation driven by an infinite dimensional martingale is established. The solution of this equation takes…
We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…
A dominating set of a graph is a set of vertices such that every vertex not in the set has at least one neighbor in the set. The problem of counting dominating sets is #P-complete for chordal graphs but solvable in polynomial time for its…
A sparse linear programming (SLP) problem is a linear programming problem equipped with a sparsity (or cardinality) constraint, which is nonconvex and discontinuous theoretically and generally NP-hard computationally due to the…
In a simple connected graph $G=(V,E)$, a subset of vertices $S \subseteq V$ is a dominating set if any vertex $v \in V\setminus S$ is adjacent to some vertex $x$ from this subset. A number of real-life problems can be modeled using this…
The secure domination numbers of the Cartesian products of two small graphs with paths or cycles is determined, as well as for Mobius ladder graphs. Prior to this work, in all cases where the secure domination number has been determined,…
We control a broad class of singular (or "rough") Fourier multipliers by geometrically-defined maximal operators via general weighted $L^2(\mathbb{R})$ norm inequalities. The multipliers involved are related to those of Coifman--Rubio de…
This paper considers the stochastic linear quadratic optimal control problem in which the control domain is nonconvex. By the functional analysis and convex perturbation methods, we establish a novel maximum principle. The application of…
The concept of generalized domination unifies well-known variants of domination-like and independence problems, such as Dominating Set, Independent Set, Perfect Code, etc. A generalized domination (also called $[\sigma,\rho]$-Dominating…
In this note, we show that if $T$ is a Calder\'on--Zygmund operator satisfying $T(1)=0$, then the usual sparse domination for $T$ can be sharpened by replacing local averages by local mean oscillations. As an application, we characterize…
We study a specific convex maximization problem in the space of continuous functions defined on a semi-infinite interval. An unexplained connection to the discrete version of this problem is investigated.
We study the complexity of the two dual covering and packing distance-based problems Broadcast Domination and Multipacking in digraphs. A dominating broadcast of a digraph $D$ is a function $f:V(D)\to\mathbb{N}$ such that for each vertex…
The domination problem and several of its variants (total domination, 2-domination and secure domination) are considered. These problems have various real-world applications, but are NP-hard to solve to provable optimality, making fast…
This paper considers derivation of $f$-divergence inequalities via the approach of functional domination. Bounds on an $f$-divergence based on one or several other $f$-divergences are introduced, dealing with pairs of probability measures…
We prove that if there is a dominating family of size ${\aleph}_{1}$, then there is are ${\aleph}_{1}$ many compact subsets of ${\omega}^{\omega}$ whose union is a maximal almost disjoint family of functions that is also maximal with…
In this note, we show that if $T$ is a multilinear singular integral operator associated with a kernel satisfies the so-called multilinear $L^{r}$-H\"ormander condition, then $T$ can be dominated by multilinear sparse operators.
Consider a monomial curve $\gamma:\mathbb{R}\to\mathbb{R}^{d}$ and a family of truncated Hilbert transforms along $\gamma$, $\mathcal{H}^{\gamma}$. This paper addresses the possibility of the pointwise sparse domination of the $r$-variation…