Related papers: Graphic lambda calculus and knot diagrams
Some new infinite families of simple, indecomposable $m$-factorizations of the complete multigraph $\lambda K_v$ are presented. Most of the constructions come from finite geometries.
We study alternating strand diagrams on the disk with an orbifold point. These are quotients by rotation of Postnikov diagrams on the disk, and we call them orbifold diagrams. We associate a quiver with potential to each orbifold diagram,…
The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…
The form factor of a quantum graph is a function measuring correlations within the spectrum of the graph. It can be expressed as a double sum over the periodic orbits on the graph. We propose a scheme which allows one to evaluate the…
We study various representations for cyclic lambda-terms as higher-order or as first-order term graphs. We focus on the relation between 'lambda-higher-order term graphs' (lambda-ho-term-graphs), which are first-order term graphs endowed…
In typical non-idempotent intersection type systems, proof normalization is not confluent. In this paper we introduce a confluent non-idempotent intersection type system for the lambda-calculus. Typing derivations are presented using proof…
We study Milner's lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of \b{eta}-strong normalisation and characterisation of strongly normalisable terms via an intersection…
A general framework for obtaining certain types of contracted and centrally extended algebras is presented. The whole process relies on the existence of quadratic algebras, which appear in the context of boundary integrable models.
The paper introduces the notion of a representation $k$-graph $(\Delta,\alpha)$ for a given $k$-graph $\Lambda$. It is shown that any representation $k$-graph for $\Lambda$ yields a module for the Kumjian-Pask algebra $KP(\Lambda)$, and the…
The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…
We define a new mathematical structure ( graph quantum group) which combines the tower of algebras associated with a graph ${\cal G}$ and the structure of a Hopf algebra {\cal A}. In this structure Ocneanu's string operators become Hopf…
We present a category theoretical generalization of the Goussarov theorem for finite type invariants, relating generating sets for generalized finite type theories with diagrams systems for the corresponding topological objects. We will…
Graph-based semantic representations are valuable in natural language processing, where it is often simple and effective to represent linguistic concepts as nodes, and relations as edges between them. Several attempts has been made to find…
We describe some connections between three different fields: combinatorics (umbral calculus), functional analysis (linear functionals and operators) and harmonic analysis (convolutions on group-like structures). Systematic usage of…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
Here are considered some categorical aspects of "Differential calculus" archetype of local approximation of arbitrary morphisms by "linear" ones.
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
We initiate the study of real $C^*$-algebras associated to higher-rank graphs $\Lambda$, with a focus on their $K$-theory. Following Kasparov and Evans, we identify a spectral sequence which computes the $\mathcal{CR}$ $K$-theory of…