Related papers: On convergence structures in graphs

We continue Gartside, Moody, and Stares' study of versions of monotone paracompactness. We show that the class of spaces with a monotone closure-preserving open operator is strictly larger than those with a monotone open locally-finite…

Let $E$ and $F$ be Hilbert $C^*$-modules over a $C^*$-algebra $\CAlg{A}$. New classes of (possibly unbounded) operators $t:E\to F$ are introduced and investigated. Instead of the density of the domain $\Def(t)$ we only assume that $t$ is…

Vertex operator algebras are mathematically rigorous objects corresponding to chiral algebras in conformal field theory. Operads are mathematical devices to describe operations, that is, $n$-ary operations for all $n$ greater than or equal…

Following Hartigan, a cluster is defined as a connected component of the t-level set of the underlying density, i.e., the set of points for which the density is greater than t. A clustering algorithm which combines a density estimate with…

We introduce the concepts of closed sets and closure operators as mathematical tools for the study of social networks. Dynamic networks are represented by transformations. It is shown that under continuous change/transformation, all…

A topological group $X$ is called connected if the only subsets which are both open and closed are the whole space $X$ and the null set $\emptyset$. A subset of a topological group is connected if the subspace is connected. We say that a…

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…

The scaled relative graph (SRG) of an operator is a subset of the complex plane. It captures several salient features of an operator, such as contractiveness, and can be used to reveal the geometric nature of many of the inequality based…

For every graph $H$, there exists a polynomial-time algorithm deciding if a planar input graph $G$ can be contracted to~$H$. However, the degree of the polynomial depends on the size of $H$. In this paper, we identify a class of graphs…

On a category $\mathscr{C}$ with a designated (well-behaved) class $\mathcal{M}$ of monomorphisms, a closure operator in the sense of D. Dikranjan and E. Giuli is a pointed endofunctor of $\mathcal{M}$, seen as a full subcategory of the…

A topologized semilattice $X$ is called complete if each non-empty chain $C\subset X$ has $\inf C$ and $\sup C$ that belong to the closure $C$ of the chain $C$ in $X$. In this paper, we introduce various concepts of completeness of…

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…

The notion of vertex operator coalgebra is presented and motivated via the geometry of conformal field theory. Specifically, we describe the category of geometric vertex operator coalgebras, whose objects have comultiplicative structures…

The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of upper embeddable graphs that for each graph G in G, every weak…

We construct a topology on the standard Hilbert module $l^2(\mathcal A)$ over a unital $W^*$-algebra $\mathcal A$ such that any "compact" operator, (i.e.\ any operator in the norm closure of the linear span of the operators of the form…

An operator algebra $\mathcal{A}$ acting on a Hilbert space is said to have the closability property if every densely defined linear transformation commuting with $\mathcal{A}$ is closable. In this paper we study the closability property of…

Given a graph $G$ whose edges are perfectly reliable and whose nodes each operate independently with probability $p\in[0,1],$ the node reliability of $G$ is the probability that at least one node is operational and that the operational…

It was shown in arXiv:0906.2527, that in finite-dimensional Hilbert spaces each operator system corresponds to some channel, for which this operator system will be an operator graph. This work is devoted to finding necessary and sufficient…

Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the notion of a recognizable set of graphs in terms of finite…

A topology on a set $X$ is the same as a projection (i.e. an idempotent linear operator) $cl:2^X\to 2^X$ satisfying $A\subset cl(A)$ for all $A\subset X$. That's a good way to summarize Kuratowski's closure operator. Basic geometry on a set…