Related papers: Sparse domination and the strong maximal function
In this article, we study a generalized version of the maximum independent set and minimum dominating set problems, namely, the maximum $d$-distance independent set problem and the minimum $d$-distance dominating set problem on unit disk…
We obtain sharp estimates for the quasi norm of the maximal function of f when it satisfies certain conditions.
The dimension of the visible part of self-affine sets, that satisfy domination and a projection condition, is being studied. The main result is that the assouad dimension of the visible part equals to 1 for all directions outside the set of…
In this note we describe some recent advances in the area of maximal function inequalities. We also study the behaviour of the centered Hardy-Littlewood maximal operator associated to certain families of doubling, radial decreasing…
Deep neural networks have emerged as powerful tools for learning operators defined over infinite-dimensional function spaces. However, existing theories frequently encounter difficulties related to dimensionality and limited…
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse…
Priebe et al. (2001) introduced the class cover catch digraphs and computed the distribution of the domination number of such digraphs for one dimensional data. In higher dimensions these calculations are extremely difficult due to the…
Let $L$ be a closed, densely defined operator on $L^2(\mathbb{R}^n)$ satisfying suitable $L^p-L^q$ off-diagonal estimates of order $\kappa > 0$. This paper aims to investigate the two-weight estimate and the Bloom weighted estimate for the…
In this article, we study questions of uniqueness of form extension for certain magnetic Schr\"odinger forms. The method is based on the theory of ordered Hilbert spaces and the concept of domination of semigroups. We review this concept in…
We prove a sharp integral inequality for the dyadic maximal operator, connecting integrals of $\phi$, and of the dyadic maximal function of $\phi$.
In this paper, using a new technique from harmonic analysis called sparse domination, we characterize the positive Borel measures including forward, vanishing, and reverse Bergman Carleson measures. The main novelty of this paper is…
We prove that a simple distributed algorithm finds a constant approximation of an optimal distance-$k$ dominating set in graphs with no $K_{2,t}$-minor. The algorithm runs in a constant number of rounds. We further show how this procedure…
This work advances the maximum hands-off sparse control framework by developing a robust counterpart for constrained linear systems with parametric uncertainties. The resulting optimal control problem minimizes an $L^{0}$ objective subject…
The principle of smooth fit is probably the most used tool to find solutions to optimal stopping problems of one-dimensional diffusions. It is important, e.g., in financial mathematical applications to understand in which kind of models and…
A set of vertices $X\subseteq V(G)$ is a $d$-distance dominating set if for every $u\in V(G)\setminus X$ there exists $x\in X$ such that $d(u,x) \le d$, and $X$ is a $p$-packing if $d(u,v) \ge p+1$ for every different $u,v\in X$. The…
New sufficient conditions for representation of a function via the absolutely convergent Fourier integral are obtained in the paper. In the main result, Theorem 1.1, this is controlled by the behavior near infinity of both the function and…
In this paper, we study efficient domination in regular graphs.
We seek to create tools for a model-theoretic analysis of types in algebraically closed valued fields (ACVF). We give evidence to show that a notion of 'domination by stable part' plays a key role. In Part A, we develop a general theory of…
We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a…
In this paper, we establish quantitative weak type estimates for operators that are dominated by (fractional) sparse operators in bilinear sense. Specifically, we derive bounds for both the restricted weak type $L^{p,1}\rightarrow…