Related papers: Domination and Closure

A dominating set $S$ of a graph $G$ of order $n$ is a subset of the vertices of $G$ such that every vertex is either in $S$ or adjacent to a vertex of $S$. The domination polynomial is defined by $D(G,x) = \sum d_k x^k$ where $d_k$ is the…

We prove some unconditional cases of the Existential Closedness problem for the modular $j$-function. For this, we show that for any finitely generated field we can find a "convenient" set of generators. This is done by showing that in any…

A dynamical system is called contractive if any two solutions approach one another at an exponential rate. More precisely, the dynamics contracts lines at an exponential rate. This property implies highly ordered asymptotic behavior…

We introduce the resolvent composition, a monotonicity-preserving operation between a linear operator and a set-valued operator, as well as the proximal composition, a convexity-preserving operation between a linear operator and a function.…

The paper is devoted to establishing relationships between global and local monotonicity, as well as their maximality versions, for single-valued and set-valued mappings between finite-dimensional and infinite-dimensional spaces. We first…

For a locally compact group $G$ we consider the algebra $CD(G)$ of convolution dominated operators on $L^{2}(G)$: An operator $A:L^2(G)\to L^2(G)$ is called convolution dominated if there exists $a\in L^1(G)$ such that for all $f \in…

Given $\texttt{S}|\texttt{R}$ a finite Galois extension of finite chain rings and $\mathcal{B}$ an $\texttt{S}$-linear code we define two Galois operators, the closure operator and the interior operator. We proof that a linear code is…

Discrete-time regulatory networks are dynamical systems on directed graphs, with a structure inspired on natural systems of interacting units. There is a natural notion of determination amongst vertices, which we use to classify the nodes…

In finite problems comprising objects, situations, and an object- and situation-contingent payoff function, we study the comparative statics of the set of undominated objects, meaning those for which there exists no mixture over objects…

We prove a bilinear form sparse domination theorem that applies to many multi-scale operators beyond Calder\'on-Zygmund theory, and also establish necessary conditions. Among the applications, we cover large classes of Fourier multipliers,…

Several aspects of the interplay between monotone operator theory and convex optimization are presented. The crucial role played by monotone operators in the analysis and the numerical solution of convex minimization problems is emphasized.…

Let $H_1$ and $H_2$ be complex Hilbert spaces and $T:H_1\rightarrow H_2$ be a bounded linear operator. We say $T$ to be norm attaining, if there exists $x\in H_1$ with $\|x\|=1$ such that $\|Tx\|=\|T\|$. If for every closed subspace $M$ of…

A digraph $D$ is an efficient closed domination digraph if there exists a subset $S$ of $V(D)$ for which the closed out-neighborhoods centered in vertices of $S$ form a partition of $V(D)$. In this work we deal with efficient closed…

Let $G=(V,E)$ be a graph. A subset $D\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. A dominating set $D$ is called a total dominating set if every vertex in $D$ is adjacent to a vertex in $D$.…

We prove that the resolvent set of any, possibly singular, quasi periodic Jacobi operator is characterized as the set of all energies whose associated Jacobi cocycles induce a dominated splitting. This extends a well-known result by R. A.…

A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its…

Complex systems are composed of a large number of simple components connected to each other in the form of a network. It is shown that, for some network configurations, the equivalent dynamic behavior of the system is governed by an…

The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number. It is established that the two…

We describe all linear operators which maps $n-1$-dimensional simplex of idempotent measures to itself. Such operators divided to two classes: the first class contains all $n\times n$-matrices with non-negative entries which has at least…

This article is to give an infinite dimensional analogue of a result of Choi and Effros. We say that an (not necessarily unital) operator system $T$ is \emph{dualizable} if one can find an equivalent dual matrix norm on the dual space $T^*$…