Related papers: A coalgebraic model of graphs

Processes are often viewed as coalgebras, with the structure maps specifying the state transitions. In the simplest case, the state spaces are discrete, and the structure map simply takes each state to the next states. But the coalgebraic…

For a (semi-)model category M, we define a notion of a ''homotopy'' Grothendieck topology on M, as well as its associated model category of stacks. We use this to define a notion of geometric stack over a symmetric monoidal base model…

The notion of term graph encodes a refinement of inductively generated syntax in which regard is paid to the the sharing and discard of subterms. Inductively generated syntax has an abstract expression in terms of initial algebras for…

A functor from the category of directed trees with inclusions to the category of commutative C*-algebras with injective *-homomorphisms is constructed. This is used to define a functor from the category of directed graphs with inclusions to…

We show that the comma category $(\mathcal{F}\downarrow\mathbf{Grp})$ of groups under the free group functor $\mathcal{F}: \mathbf{Set} \to \mathbf{Grp}$ contains the category $\mathbf{Gph}$ of simple graphs as a full coreflective…

We show that a structural matrix algebra $A$ is isomorphic to the endomorphism algebra of an algebraic-combinatorial object called a generalized flag. If the flag is equipped with a group grading, an algebra grading is induced on $A$. We…

We introduce an enriched notion of a coalgebra over an operad P in a symmetric monoidal V-category C. When C is semicartesian and P is unital, we construct a V-endofunctor on C associated to P and give conditions under which it is a…

We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…

The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit…

Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…

We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types…

Let $X$ be a non-empty set and $\sP(X)$ be its power set. A set-valuation or a set-labeling of a given graph $G$ is an injective function $f:V(G) \to \sP(X)$ such that the induced function $f^{\ast}:E(G) \to \sP(X)$ defined by $f^{\ast}…

Categorical deep learning (CDL) has recently emerged as a framework that leverages category theory to unify diverse neural architectures. While geometric deep learning (GDL) is grounded in the specific context of invariants of group…

This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective…

We characterise the slices of the category of graphs that are algebraically universal in terms of the structure of the slicing graph. In particular, we show that algebraic universality is obtained if, and only if, the slicing graph contains…

Diagrammatic sets are presheaves on a rich category of shapes, whose definition is motivated by combinatorial topology and higher-dimensional diagram rewriting. These shapes include representatives of oriented simplices, cubes, and positive…

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…

An operation on species corresponding to the inner plethysm of their associated cycle index series is constructed. This operation, the inner plethysm of species, is generalized to n-sorted species. Polynomial maps on species are studied and…

Given a graph G=(V, E), a vertex is said to ve-dominate an edge if it is either incident with the edge or adjacent to one of its endpoints. A set of vertices is a ve-dominating set if it ve-dominates every edge of the graph. We introduce…