Related papers: Graphic lambda calculus and knot diagrams
A pseudodiagram is a diagram of a knot with some crossing information missing. We review and expand the theory of pseudodiagrams introduced by R. Hanaki. We then extend this theory to the realm of virtual knots, a generalization of knots.…
Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…
This article presents a survey of work on lifted graphical models. We review a general form for a lifted graphical model, a par-factor graph, and show how a number of existing statistical relational representations map to this formalism. We…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of…
We construct an additive category where objects are embedded graphs in the 3-sphere and morphisms are geometric correspondences given by 3-manifolds realized in different ways as branched covers of the 3-sphere, up to branched cover…
We present an untyped linear lambda calculus with braids, the corresponding combinatory logic, and the semantic models given by crossed G-sets.
Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph…
Starting from a graded Frobenius superalgebra $B$, we consider a graphical calculus of $B$-decorated string diagrams. From this calculus we produce algebras consisting of closed planar diagrams and of closed annular diagrams. The action of…
We present a formulation of quantum circuit diagrams based on the exponential map which provides a new way to calculate graphically with circuits. We present a sound list of rewrite rules for this formulation and demonstrate a variety of…
We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…
We introduce and study knotoids. Knotoids are represented by diagrams in a surface which differ from the usual knot diagrams in that the underlying curve is a segment rather than a circle. Knotoid diagrams are considered up to Reidemeister…
A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.
We investigate a class of nominal algebraic Henkin-style models for the simply typed lambda-calculus in which variables map to names in the denotation and lambda-abstraction maps to a (non-functional) name-abstraction operation. The…
The mathematics underlying the connection between deconstruction lattices and locality diagrams of conformal models is developed from scratch, with special emphasis on classification issues. In particular, the notions of equilocality…
In this paper, we present new obstructions to the existence of Lagrangian cobordisms in $\mathbb{R}^4$ that depend only on the enriched knot diagrams of the boundary knots or links, using holomorphic curve techniques. We define enriched…
We define some signature invariants for a class of knotted trivalent graphs using branched covers. We relate them to classical signatures of knots and links. Finally, we explain how to compute these invariants through the example of…
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…
The syntax of modal graphs is defined in terms of the continuous cut and broken cut following Charles Peirce's notation in the gamma part of his graphical logic of existential graphs. Graphical calculi for normal modal logics are developed…