Related papers: A coalgebraic model of graphs
We construct recursion categories from categories of coalgebras. Let $F$ be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category $\textbf{Set}_F$ of $F$-coalgebras is complete. The…
We consider graphs E which have been obtained by adding one or more sinks to a fixed directed graph G. We classify the C*-algebra of E up to a very strong equivalence relation, which insists, loosely speaking, that C*(G) is kept fixed. The…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
A set $S$ of vertices in a graph $G(V,E)$ is called a dominating set if every vertex $v\in V$ is either an element of $S$ or is adjacent to an element of $S$. A set $S$ of vertices in a graph $G(V,E)$ is called a total dominating set if…
Knowledge graph (KG) representation learning aims to encode entities and relations into dense continuous vector spaces such that knowledge contained in a dataset could be consistently represented. Dense embeddings trained from KG datasets…
A function $f$ of a graph is called a complete graph invariant if the isomorphism of graphs $G$ and $H$ is equivalent to the equality $f(G)=f(H)$. If, in addition, $f(G)$ is a graph isomorphic to $G$, then $f$ is called a canonical form for…
In their paper Scholze and Weinstein show that a certain diagram of perfectoid spaces is Cartesian. In this paper, we generalize their result. This generalization will be used in a forthcoming paper of ours to compute certain non-trivial…
Knowledge graph embedding involves learning representations of entities -- the vertices of the graph -- and relations -- the edges of the graph -- such that the resulting representations encode the known factual information represented by…
Knowledge Graph (KG) is a graph based data structure to represent facts of the world where nodes represent real world entities or abstract concept and edges represent relation between the entities. Graph as representation for knowledge has…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
A multi-relational graph maintains two or more relations over a vertex set. This article defines an algebra for traversing such graphs that is based on an $n$-ary relational algebra, a concatenative single-relational path algebra, and a…
We study extensively the homotopy theory of coalgebras. By coalgebras, we mean the full theory of coalgebras: with counits and not necessarily locally conilpotent. For example $\mathcal E_\infty$-coalgebras, $\mathcal A_\infty$-coalgebras,…
Knowledge Graphs (KG) constitute a flexible representation of complex relationships between entities particularly useful for biomedical data. These KG, however, are very sparse with many missing edges (facts) and the visualisation of the…
We define varieties of algebras for an arbitrary endofunctor on a cocomplete category using pairs of natural transformations. This approach is proved to be equivalent to the one of equational classes defined by equation arrows. Free…
Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…
Let G be a simple complex algebraic group. By using a notion of a G-category we define invariants of tangles with flat G-connections in their complements. We also show that quantized universal enveloping algebras at roots of unity provide…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
Knowledge graphs are used to represent relational information in terms of triples. To enable learning about domains, embedding models, such as tensor factorization models, can be used to make predictions of new triples. Often there is…
We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…
Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…