Related papers: A coalgebraic model of graphs

Graphs are a useful abstraction of image content. Not only can graphs represent details about individual objects in a scene but they can capture the interactions between pairs of objects. We present a method for training a convolutional…

We generalize the construction of tensor categories of endomorphisms of a type III factor $M$ associated with a $G$-kernel, from the case of a discrete group $G$ to that of a compact second countable group. Our approach is based on the…

We show that the (co)endomorphism algebra of a sufficiently separable "fibre" functor into Vect_k, for k a field of characteristic 0, has the structure of what we call a "unital" von Neumann core in Vect_k. For Vect_k, this particular…

We present different ways of endowing a particular category of graphs with Quillen model structures. We show, among other things, that the core of a graph can be seen as its homotopy type in an appropriate Quillen model structure, and that…

Cofibration categories are a formalization of homotopy theory useful for dealing with homotopy colimits that exist on the level of models as colimits of cofibrant diagrams. In this paper, we deal with their enriched version. Our main result…

One goal of applied category theory is to better understand networks appearing throughout science and engineering. Here we introduce "structured cospans" as a way to study networks with inputs and outputs. Given a functor $L \colon…

We develop a representation theory of categories as a means to explore characteristic structures in algebra. Characteristic structures play a critical role in isomorphism testing of groups and algebras, and their construction and…

Let $G$ be a group. We define the coprime graph of subgroups of $G$, denoted by $\mathcal P(G)$, is a graph whose vertex set is the set of all proper subgroups of $G$, and two distinct vertices are adjacent if and only if the order of the…

The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…

We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose basis is the set Hom(X,Y). The isomorphism is functorial in…

Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…

Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…

In this thesis, we develop the theory of bifibrations of polycategories. We start by studying how to express certain categorical structures as universal properties by generalising the shape of morphism. We call this phenomenon…

Scott's graph model is a lambda-algebra based on the observation that continuous endofunctions on the lattice of sets of natural numbers can be represented via their graphs. A graph is a relation mapping finite sets of input values to…

Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…

Let $ G=(V,E) $ be a simple graph of order $ n $ and size $ m $. A connected edge cover set of a graph is a subset $S$ of edges such that every vertex of the graph is incident to at least one edge of $S$ and the subgraph induced by $S$ is…

Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…

We study families of self-adjoint operators with given spectra whose sum is a scalar operator. Such families are $*$-representations of certain algebras which can be described in terms of graphs and positive functions on them. The main…

Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v in V, there is…

The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.