Related papers: A coalgebraic model of graphs

In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations…

In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…

We study a generalization of the Svarc genus of a fiber map. For an arbitrary collection E of spaces and a map f:X-->Y, we define a numerical invariant, the E-sectional category of f, in terms of open covers of Y. We obtain several basic…

We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…

We combine the theory of inductive data types with the theory of universal measurings. By doing so, we find that many categories of algebras of endofunctors are actually enriched in the corresponding category of coalgebras of the same…

Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…

Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.

We generalize the enhanced power graph by replacing elements with classes under automorphisms. We show that the connectivity and diameter of this graph is similar to that of the enhanced power graph. We consider the universal vertices of…

In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…

For a graph $\mathbb{Q}=(\mathbb{V},\mathbb{E})$, the transformation graphs are defined as graphs with vertex set being $\mathbb{V(Q)} \cup \mathbb{E(Q)}$ and edge set is described following certain conditions. In comparison to the…

The presented work focuses on problems from determinant theory, set theory and topology. The term graph is the binding element that connects these problems. Graphs are distinguished by their geometrical simplicity, which helps in showing…

We study and relate categories of modules, comodules and contramodules over a representation of a small category taking values in (co)algebras, in a manner similar to modules over a ringed space. As a result, we obtain a categorical…

The relative cell complexes with respect to a generating set of cofibrations are an important class of morphisms in any model structure. In the particular case of the standard (algebraic) model structure on $\textbf{Top}$, we give a new…

The aim of the paper is to build a connection between two approaches towards categorical language theory: the coalgebraic and algebraic language theory for monads. For a pair of monads modelling the branching and the linear type we defined…

Let $G_1$ and $G_2$ be disjoint copies of a graph $G$, and let $f: V(G_1) \rightarrow V(G_2)$ be a function. Then a \emph{functigraph} $C(G, f)=(V, E)$ has the vertex set $V=V(G_1) \cup V(G_2)$ and the edge set $E=E(G_1) \cup E(G_2) \cup…

Graphical models can represent a multivariate distribution in a convenient and accessible form as a graph. Causal models can be viewed as a special class of graphical models that not only represent the distribution of the observed system…

We introduce a theory for encoding and manipulating algebraic data on categories via $\textit{concentration structures}$, which are equivalence relations on morphisms that satisfy certain axioms. For any category with a concentration…

We consider two types of geometric graphs on point sets on the plane based on a plane set C: one obtained by translates of C, another by positively scaled translates (homothets) of C. For compact and convex C, graphs defined by scaled…

The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…

Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…