Related papers: Some remarks on the pointwise sparse domination
In networked control systems, communication resource constraints often necessitate the use of \emph{sparse} control input vectors. A prototypical problem is how to ensure controllability of a linear dynamical system when only a limited…
We study the parameterized complexity of domination-type problems. (sigma,rho)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G is (sigma,rho)-dominating if for any v in D, |N(v)\cap D| in…
In this paper, we initiate the study of a new interrelation between linear ordinary differential operators and complex dynamics which we discuss in details in the simplest case of operators of order $1$. Namely, assuming that such an…
We establish a domination principle for positive operators, which provides an upper bound on the essential spectral radius and yields quasi-compactness criteria on weighted supremum spaces with Lyapunov type functions and local domination.…
In this paper, we build up a framework for sparse interpolation. We first investigate the theoretical limit of the number of unisolvent points for sparse interpolation under a general setting and try to answer some basic questions of this…
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 analyse approximation algorithms (greedy heuristics) for the classical domination number and two multiple domination numbers in simple graphs. First, we present a short self-contained proof of the known result that the minimum domination…
We give an exact characterization of monotone graph classes C with bounded average degree that satisfy the following property: The domination number of every graph from C is bounded by a linear function of its 2-independence number.
The target stationary distribution problem (TSDP) is the following: given an irreducible stochastic matrix $G$ and a target stationary distribution $\hat \mu$, construct a minimum norm perturbation, $\Delta$, such that $\hat G = G+\Delta$…
In this article, we address pointwise sparse domination for multilinear Calder\'on-Zygmund operators on upper doubling, geometrically doubling metric measure spaces. As a consequence, we have obtained sharp quantitative weighted estimates…
We prove sharp weak type weighted estimates for a class of sparse operators that includes majorants of standard $\alpha$-fractional singular integrals, fractional integral operators, Marcinkiewicz integral operators, and square functions.…
In this paper we present two different results in the context of nonlinear analysis. The first one is essentially a nonlinear technique that, in view of its strong generality, may be useful in different practical problems. The second…
In this note we give a simplified ordinal analysis of first-order reflection. An ordinal notation system $OT$ is introduced based on $\psi$-functions. Provable $\Sigma_{1}$-sentences on $L_{\omega_{1}^{CK}}$ are bounded through…
Compressive sensing claims that the sparse signals can be reconstructed exactly from many fewer measurements than traditionally believed necessary. One of issues ensuring the successful compressive sensing is to deal with the…
We show that parameterized versions of splitting theorems in Morse theory can be effectively used to generalize some famous bifurcation theorems for potential operators. In particular, such generalizations based on the author's recent…
The goal of this paper is to analyze the pointwise controllability properties of a one-dimensional degenerate/singular equation. We prove the conditions that characterize approximate and null controllability. Besides, a numerical simulation…
In this article, for modelling numeral systems, the operator approach, which is introduced in [25], is generalized for a certain case. An example of such numeral systems is introduced and considered.
Given a dominating set, how much smaller a dominating set can we find through elementary operations? Here, we proceed by iterative vertex addition and removal while maintaining the property that the set forms a dominating set of bounded…
In this paper, we study one of the fundamental notions in dynamical systems, the shadowing of invertible (bounded and linear) operators on a Hilbert space. Although the problem of finding a spectral characterization for shadowing has been…
Let $G=(V,E)$ be a graph without isolated vertices. A set $S\subseteq V$ is a paired-domination set if every vertex in $V-S$ is adjacent to a vertex in $S$ and the subgraph induced by $S$ contains a perfect matching. The paired-domination…