Related papers: Some remarks on the pointwise sparse domination

We prove boundedness of Calder\'on-Zygmund operators acting in Banach functions spaces on domains, defined by the $L_1$ Carleson functional and $L_q$ ($1<q<\infty$) Whitney averages. For such bounds to hold, we assume that the operator maps…

Convex body domination is a technique, where operators acting on vector-valued functions are estimated via certain convex body averages of the input functions. This domination lets one deduce various matrix weighted bounds for these…

In this paper we obtain quantitative weighted $L^p$-inequalities for some operators involving Bessel convolutions. We consider maximal operators, Littlewood-Paley functions and variational operators. We obtain $L^p(w)$-operator norms in…

By means of appropriate sparse bounds, we deduce compactness on weighted $L^p(w)$ spaces, $1<p<\infty$, for all Calder\'on-Zygmund operators having compact extensions on $L^2(\mathbb{R}^n)$. Similar methods lead to new results on…

We prove a global domination principle in the setting of P-pluripotential theory. This has many applications including a general product property for P-extremal functions. The key ingredient is the proof of the existence of a strictly…

$k$-defensive domination, a variant of the classical domination problem on graphs, seeks a minimum cardinality vertex set providing a surjective defense against any attack on vertices of cardinality bounded by a parameter $k$. The problem…

We obtain a simple formula for the first-order trace of a regular differential operator on a segment perturbated by a multiplication operator. The main analytic ingredient of the proof is an improvement of the Tamarkin equiconvergence…

We introduce the so called convex body valued sparse operators, which generalize the notion of sparse operators to the case of spaces of vector valued functions. We prove that Calder\'on--Zygmund operators as well as Haar shifts and…

A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a…

We use the very recent approach developed by Lacey in [23] and extended by Bernicot-Frey-Petermichl in [3], in order to control Bochner-Riesz operators by a sparse bilinear form. In this way, new quantitative weighted estimates, as well as…

In this work, we consider the controllability of a discrete-time linear dynamical system with sparse control inputs. Sparsity constraints on the input arises naturally in networked systems, where activating each input variable adds to the…

In this short note, we establish an operator theoretic version of the Wiener-Ikehara tauberian theorem, and point out how this leads to a new proof of the Prime number theorem that should be accessible to anyone with a basic knowledge of…

This dissertation concerns the pseudo-differential operators of type 1,1. These have been known especially since around 1980, when it was shown that they play an important role in the treatment of fully non-linear partial differential…

The secure domination problem, a variation of the domination problem with some important real-world applications, is considered. Very few algorithmic attempts to solve this problem have been presented in literature, and the most successful…

Apart from few exceptions, the mathematical runtime analysis of evolutionary algorithms is mostly concerned with expected runtimes. In this work, we argue that stochastic domination is a notion that should be used more frequently in this…

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 give a short proof of the sharp weighted bound for sparse operators that holds for all $p$, $1<p<\infty$. By recent developments this implies the bounds hold for any Calder\'on-Zygmund operator. The novelty of our approach is that we…

This article treats optimal sparse control problems with multiple constraints defined at intermediate points of the time domain. For such problems with intermediate constraints, we first establish a new Pontryagin maximum principle that…

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…

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…