Related papers: Zipper logic
Inferring missing links or detecting spurious ones based on observed graphs, known as link prediction, is a long-standing challenge in graph data analysis. With the recent advances in deep learning, graph neural networks have been used for…
Building on recently established enumerative connections between lambda calculus and the theory of embedded graphs (or "maps"), this paper develops an analogy between typing (of lambda terms) and coloring (of maps). Our starting point is…
Computational approaches to exploring "chemical universes", i.e., very large sets, potentially infinite sets of compounds that can be constructed by a prescribed collection of reaction mechanisms, in practice suffer from a combinatorial…
Graph-based reaction systems were recently introduced as a generalization of the intensely studied set-based reaction systems. They deal with simple edge-labeled directed graphs, and dynamic semantics of graph-based reaction systems is…
The concept of diagrammatic combinatorial Hopf algebras in the form introduced for describing the Heisenberg-Weyl algebra in~\cite{blasiak2010combinatorial} is extended to the case of so-called rule diagrams that present graph rewriting…
A zigzag in a map (a $2$-cell embedding of a connected graph in a connected closed $2$-dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a…
Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. \Beta-reduction. Traditional presentations of interaction nets are based on graph theory and rely on…
To a higher rank directed graph $(\Lambda, d)$, in the sense of Kumjian and Pask, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed. We introduce methods for the classification of these…
The local structure of a tiling is described in terms of a multiplicative structure on its pattern classes. The groupoid associated to the tiling is derived from this structure and its integer group of coinvariants is defined. This group…
We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in a non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is a…
The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. Chemical graph theory is a branch of mathematical…
The primary goal of this paper is to present a unified way to transform the syntax of a logic system into certain initial algebraic structure so that it can be studied algebraically. The algebraic structures which one may choose for this…
Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is…
Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…
We develop a theory of rewriting for structured cospans in order to extend compositional methods for modeling open networks. First, we introduce a category whose objects are structured cospans, and establish conditions under which it is…
Linear logic is a substructural logic proposed as a refinement of classical and intuitionistic logics, with applications in programming languages, game semantics, and quantum physics. We present a template for Gentzen-style linear logic…
We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be…
Chemical reaction networks can be automatically generated from graph grammar descriptions, where rewrite rules model reaction patterns. Because a molecule graph is connected and reactions in general involve multiple molecules, the rewriting…
Given a graph $G$, a vertex switch of $v \in V(G)$ results in a new graph where neighbors of $v$ become nonneighbors and vice versa. This operation gives rise to an equivalence relation over the set of labeled digraphs on $n$ vertices. The…
The ZX-calculus is a graphical language for suitably represented tensor networks, called ZX-diagrams. Calculations are performed by transforming ZX-diagrams with rewrite rules. The ZX-calculus has found applications in reasoning about…