Related papers: Domination and Closure
We show that a densely defined closable operator $A$ such that the resolvent set of $A^2$ is not empty is necessarily closed. This result is then extended to the case of a polynomial $p(A)$. We also generalize a recent result by…
The well-known notion of domination in a graph abstracts the idea of protecting locations with guards. This paper introduces a new graph invariant, the autonomous domination number, which abstracts the idea of defending a collection of…
Using techniques from the theory of von Neumann algebras, we propose a framework for addressing questions of controllability of bilinear systems on infinite dimensional Hilbert spaces. In the setup, we assume only that the drift and control…
Our main theorem is in the generality of the axioms of Hilbert space, and the theory of unbounded operators. Consider two Hilbert spaces such that their intersection contains a fixed vector space D. It is of interest to make a precise…
Power domination is a two-step observation process that is used to monitor power networks and can be viewed as a combination of domination and zero forcing. Given a graph $G$, a subset $S\subseteq V(G)$ that can observe all vertices of $G$…
Recently, the authors studied the connection between each maximal monotone operator T and a family H(T) of convex functions. Each member of this family characterizes the operator and satisfies two particular inequalities. The aim of this…
Abstract approaches to maximum and anti-maximum principles for differential operators typically rely on the condition that all vectors in the domain of the operator are dominated by the leading eigenfunction of the operator. We study the…
We study the dynamics of the attractor of the doubling map with an asymmetrical hole by associating to each hole an element of the lexicographic world. A description of the topological entropy function is given. We show that the set of…
The study of token addition and removal and token jumping reconfiguration graphs for power domination is initiated. Some results established here can be extended by applying the methods used for power domination to reconfiguration graphs…
This article is a survey of closure operations on ideals in commutative rings, with an emphasis on structural properties and on using tools from one part of the field to analyze structures in another part. The survey is broad enough to…
This paper explores idempotent and nilpotent operators in bicomplex spaces, focusing on their properties and behavior. We define idempotent and nilpotent matrices in this framework and derive related results. Several theorems are presented…
The domination polynomials of binary graph operations, aside from union, join and corona, have not been widely studied. We compute and prove recurrence formulae and properties of the domination polynomials of families of graphs obtained by…
Koopman operator based models emerged as the leading methodology for machine learning of dynamical systems. But their scope is much larger. In fact they present a new take on modeling of physical systems, and even language. In this article…
The closure of a discrete exponential family is described by a finite set of equations corresponding to the circuits of an underlying oriented matroid. These equations are similar to the equations used in algebraic statistics, although they…
In this note, we give an example of a densely defined closed one-to-one paranormal operator $T$ whose adjoint is also injective and paranormal, but $T$ fails to be normal.
We introduce a notion of a noncommutative function defined on a domain of $d$-tuples of bounded operators on an infinite dimensional Hilbert space. Inverse and implicit function theorems in this setting are established. When these…
Finite Cartesian products of operators play a central role in monotone operator theory and its applications. Extending such products to arbitrary families of operators acting on different Hilbert spaces is an open problem, which we address…
A necessary and sufficient condition for an element of an algebra (in the sense of Universal Algebra) to be in the dominion of a subalgebra is given, in terms of transferable sets. This criterion is then used to formulate a more wieldy…
The secure domination numbers of the Cartesian products of two small graphs with paths or cycles is determined, as well as for Mobius ladder graphs. Prior to this work, in all cases where the secure domination number has been determined,…
In the literature, several identification problems in graphs have been studied, of which, the most widely studied are the ones based on dominating sets as a tool of identification. Hereby, the objective is to separate any two vertices of a…