English
Related papers

Related papers: Domination and Closure

200 papers

The introduction of the categorical notion of closure operators has unified various important notions and has led to interesting examples and applications in diverse areas of mathematics (see for example, Dikranjan and Tholen (\cite{DT})).…

Category Theory · Mathematics 2010-10-22 Joaquin Luna-Torres , Carlos Orlando Ochoa C

The notion of a firmly nonexpansive mapping is central in fixed point theory because of attractive convergence properties for iterates and the correspondence with maximal monotone operators due to Minty. In this paper, we systematically…

Functional Analysis · Mathematics 2011-01-26 Heinz H. Bauschke , Sarah M. Moffat , Xianfu Wang

We study connections between closure operators on an algebra $(A,\Om)$ and congruences on the extended power algebra defined on the same algebra. We use these connections to give an alternative description of the lattice of all subvarieties…

Rings and Algebras · Mathematics 2015-08-18 Agata Pilitowska , Anna Zamojska-Dzienio

We define a closure operation for ideals in a commutative ring which has all the good properties of solid closure (at least in the case of equal characteristic) but such that also every ideal in a regular ring is closed. This gives in…

Commutative Algebra · Mathematics 2007-05-23 Holger Brenner

Maximally monotone operators play a key role in modern optimization and variational analysis. Two useful subclasses are rectangular (also known as star monotone) and paramonotone operators, which were introduced by Brezis and Haraux, and by…

Functional Analysis · Mathematics 2012-01-23 Heinz H. Bauschke , Xianfu Wang , Liangjin Yao

We prove that a nonzero idempotent is zero-diagonal if and only if it is not a Hilbert-Schmidt perturbation of a projection, along with other useful equivalences. Zero-diagonal operators are those whose diagonal entries are identically zero…

Functional Analysis · Mathematics 2018-02-08 Jireh Loreaux , Gary Weiss

A graph is an efficient open (resp.\ closed) domination graph if there exists a subset of vertices whose open (resp.\ closed) neighborhoods partition its vertex set. Graphs that are efficient open as well as efficient closed (shortly EOCD…

Combinatorics · Mathematics 2015-11-09 Sandi Klavzar , Iztok Peterin , Ismael G. Yero

On an infinite set some closure operators are finitary (algebraic) while others are not. We can generalize this idea for a complete algebraic lattice letting the compact elements act as the finite sets. With this in mind, we will consider…

Rings and Algebras · Mathematics 2014-11-25 Martha Lee Hollist Kilpack

Let T and C be two Hilbert space operators. We prove that if T is near, in a certain sense, to an operator completely polynomially dominated with a finite bound by C, then T is similar to an operator which is completely polynomially…

Functional Analysis · Mathematics 2007-05-23 C. Badea

We shall say that a densely defined closed operator $T$ on a Hilbert space is balanced if $\cD(T)=\cD(T^*)$. Balanced operators are described in terms of their phase operators abnd their moduli. Examples of balanced operators are developed.…

Functional Analysis · Mathematics 2021-03-15 Konrad Schmüdgen

A dominating set in a graph is a set of vertices with the property that every vertex in the graph is either in the set or adjacent to something in the set. The domination sequence of the graph is the sequence whose $k$th term is the number…

Combinatorics · Mathematics 2024-08-26 David Galvin , Yufei Zhang

Recently, in order to broad the application and theoretical areas of rough sets and matroids, some authors have combined them from many different viewpoints, such as circuits, rank function, spanning sets and so on. In this paper, we…

Artificial Intelligence · Computer Science 2012-10-03 Yanfang Liu , William Zhu

We study the closure operators of polymatroids from a lattice theoretic point of view. We show that polymatroid closure operators relate to lattices enriched with a generating set in the same way that matroids relate to geometric lattices.…

Combinatorics · Mathematics 2021-12-10 William Gustafson

Complementable operators extend classical matrix decompositions, such as the Schur complement, to the setting of infinite-dimensional Hilbert spaces, thereby broadening their applicability in various mathematical and physical contexts. This…

Functional Analysis · Mathematics 2025-01-14 Sachin Manjunath Naik , P. Sam Johnson

Maximally monotone operators play important roles in optimization, variational analysis and differential equations. Finding zeros of maximally monotone operators has been a central topic. In a Hilbert space, we show that most resolvents are…

Optimization and Control · Mathematics 2013-01-29 Xianfu Wang

Certain operator algebras A on a Hilbert space have the property that every densely defined linear transformation commuting with A is closable. Such algebras are said to have the closability property. They are important in the study of the…

Functional Analysis · Mathematics 2009-08-10 H. Bercovici , R. G. Douglas , C. Foias , C. Pearcy

Domination theory has been studied extensively in the context of binary monotone systems, where the structure function is a sum of products of the component state variables, and with coefficients given by the signed domination function.…

Combinatorics · Mathematics 2025-02-26 Arne Bang Huseby

This paper grew out of the author's work on arXiv:2504.18460. Differential operators in the sense of Grothendieck acting between modules over a commutative ring can be interpreted as torsion elements in the bimodule of all operators with…

Commutative Algebra · Mathematics 2026-04-08 Leonid Positselski

An axiomatic theory of operator connections and operator means was investigated by Kubo and Ando in 1980. A connection is a binary operation for positive operators satisfying the monotonicity, the transformer inequality and the…

Functional Analysis · Mathematics 2012-08-27 Pattrawut Chansangiam , Wicharn Lewkeeratiyutkul

Pippenger's Galois theory of finite functions and relational constraints is extended to the infinite case. The functions involved are functions of several variables on a set $A$ and taking values in a possibly different set $B$, where any…

Logic · Mathematics 2015-08-10 Miguel Couceiro , Stephan Foldes