Related papers: Graphic lambda calculus and knot diagrams

Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field $k$. We survey some results on algebras of finite global dimension and address some open problems.

For a higher-rank graph $\Lambda$ with sources we detail a construction that creates a higher-rank graph $\bar{\Lambda}$ that does not have sources and contains $\Lambda$ as a subgraph. Furthermore, when $\Lambda$ is row-finite, the…

Knowledge graphs (KGs), structured as multi-relational data of entities and relations, are vital for tasks like data analysis and recommendation systems. Knowledge graph completion (KGC), or link prediction, addresses incompleteness of KGs…

Let $\boldsymbol{\Lambda}\,(=\mathbb{F}^{n^{3}})$, where $\mathbb{F}$ is a field with $|\mathbb{F}|>2$, be the space of structure vectors of algebras having the $n$-dimensional $\mathbb{F}$-space $V$ as the underlying vector space. Also let…

In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…

This paper is a concise and painless introduction to the $\lambda$-calculus. This formalism was developed by Alonzo Church as a tool for studying the mathematical properties of effectively computable functions. The formalism became popular…

We introduce a graphical calculus, consisting of a set of fermionic tensors with tensor-network equations, which can be used to perform various computations in fermionic many-body physics purely diagrammatically. The indices of our tensors…

We introduce a graphical calculus for computing morphism spaces between the categorified spin networks of Cooper and Krushkal. The calculus, phrased in terms of planar compositions of categorified Jones-Wenzl projectors and their duals, is…

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between orbits of graphs and error-correcting codes. We define a new…

There have been rapid developments in model-based clustering of graphs, also known as block modelling, over the last ten years or so. We review different approaches and extensions proposed for different aspects in this area, such as the…

We study the semantics of an untyped lambda-calculus equipped with operators representing read and write operations from and to a global store. We adopt the monadic approach to model side-effects and treat read and write as algebraic…

Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…

One way of interpreting a left Kan extension is as taking a kind of "partial colimit", whereby one replaces parts of a diagram by their colimits. We make this intuition precise by means of the "partial evaluations" sitting in the so-called…

Recently there has been growing interest in discrete homotopies and homotopies of graphs beyond treating graphs as 1-dimensional simplicial spaces. One such type of homotopy is $\times$-homotopy. Recent work by Chih-Scull has developed a…

Higher-rank graph generalisations of the Popescu-Poisson transform are constructed, allowing us to develop a dilation theory for higher rank operator tuples. These dilations are joint dilations of the families of operators satisfying…

Knot diagrams are among the most common visual tools in topology. Computer programs now make it possible to draw, manipulate and render them digitally, which proves to be useful in knot theory teaching and research. Still, an openly…

We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…

We apply the notion of a full convex subcategory to a wide range of algebras including tilted, quasi-tilted, shod, weakly shod, left and right glued, laura, simply connected, strongly simply connected, left supported, and cluster-tilted. In…

We give an explicit description of the set of all factorization structures, or twisting maps, existing between the algebras k^2 and k^2, and classify the resulting algebras up to isomorphism. In the process we relate several different…