Related papers: Sparse domination and the strong maximal function

The \textsc{Dominating Set} problem is a classical and extensively studied topic in graph theory and theoretical computer science. In this paper, we examine the algorithmic complexity of several well-known exact-distance variants of…

We prove a sparse bound for the $m$-sublinear form associated to vector-valued maximal functions of Fefferman-Stein type. As a consequence, we show that the sparse bounds of multisublinear operators are preserved via $\ell^r$-valued…

Optimization problems with stochastic dominance constraints provide a possibility to shape risk by selecting a benchmark random outcome with a desired distribution. The comparison of the relevant random outcomes to the respective benchmarks…

We prove the continuity of the value function of the sparse optimal control problem. The sparse optimal control is a control whose support is minimum among all admissible controls. Under the normality assumption, it is known that a sparse…

A multivariable version of the strong maximal function is introduced and a sharp distributional estimate for this operator in the spirit of the Jessen, Marcinkiewicz, and Zygmund theorem is obtained. Conditions that characterize the…

A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \in V(D) \setminus S$ has an adjacent vertex $v$ in $S$ with $v$ directed to $u$. The directed domination number of $D$, denoted by…

As shown in [A1], the lowest constants appearing in the weak type (1,1) inequalities satisfied by the centered Hardy-Littlewood maximal operator associated to certain finite radial measures, grow exponentially fast with the dimension. Here…

This paper concerns the long-standing question of representing (totally) anti-symmetric functions in high dimensions. We propose a new ansatz based on the composition of an odd function with a fixed set of anti-symmetric basis functions. We…

The domination polynomial D(G,x) of a graph G is the generating function of its dominating sets. We prove that D(G,x) satisfies a wide range of reduction formulas. We show linear recurrence relations for D(G,x) for arbitrary graphs and for…

Let $C_b(K)$ be the set of all bounded continuous (real or complex) functions on a complete metric space $K$ and $A$ a closed subspace of $C_b(K)$. Using the variational method, it is shown that the set of all strong peak functions in $A$…

We prove weighted weak-type $(r,r)$ estimates for operators satisfying $(r,s)$ limited-range sparse domination of $\ell^q$-type. Our results contain improvements for operators satisfying limited-range and square function sparse domination.…

We construct a new type of convergent, and asymptotic, representations, dyadic expansions. Their convergence is geometric and the region of convergence often extends from infinity down to $0^+$. We show that dyadic expansions are…

Given sparse collections of measurable sets $\mathcal S_k$, $k=1,2,\ldots ,N$, in a general measure space $(X,\mathfrak M,\mu)$, let $ \Lambda_{\mathcal S_k}$ be the sparse operator, corresponding to $\mathcal S_k$. We show that the maximal…

In this paper, we propose to study the following maximum ordinal consensus problem: Suppose we are given a metric system (M, X), which contains k metrics M = {\rho_1,..., \rho_k} defined on the same point set X. We aim to find a maximum…

The concept of power domination emerged from the problem of monitoring electrical systems. Given a graph G and a set S $\subseteq$ V (G), a set M of monitored vertices is built as follows: at first, M contains only the vertices of S and…

We present some examples that refute two recent results in the literature concerning the equality of the domination and matching numbers for power and generalized power hypergraphs. In this note we pinpoint the flaws in the proofs and…

We prove the following result: If $G$ be a connected graph on $n \ge 6$ vertices, then there exists a set of vertices $D$ with $|D| \le \frac{n}{3}$ and such that $V(G) \setminus N[D]$ is an independent set, where $N[D]$ is the closed…

In this paper, we prove bilinear sparse domination bounds for a wide class of Fourier integral operators of general rank, as well as oscillatory integral operators associated to H\"ormander symbol classes $S^m_{\rho,\delta}$ for all…

Let $G=(V,E)$ be a simple graph. A set $D\subseteq V$ is a strong dominating set of $G$, if for every vertex $x\in 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 consider Continuous Linear Programs over a continuous finite time horizon $T$, with linear cost coefficient functions and linear right hand side functions and a constant coefficient matrix, where we search for optimal solutions in the…