Related papers: String Diagram Rewrite Theory II: Rewriting with S…
Sesqui-pushout (SqPO) rewriting along non-linear rules and for monic matches is well-known to permit the modeling of fusing and cloning of vertices and edges, yet to date, no construction of a suitable concurrency theorem was available. The…
We find a Polyakov-type action for strings moving in a torsional Newton-Cartan geometry. This is obtained by starting with the relativistic Polyakov action and fixing the momentum of the string along a non-compact null isometry. For a flat…
We propose a modal logic tailored to describe graph transformations and discuss some of its properties. We focus on a particular class of graphs called termgraphs. They are first-order terms augmented with sharing and cycles. Termgraphs…
We present a new model of computation, described in terms of monoidal categories. It conforms the Church-Turing Thesis, and captures the same computable functions as the standard models. It provides a succinct categorical interface to most…
In this thesis we study field theories written on a particular model of noncommutative spacetime, the Groenewold-Moyal (GM) plane. We start with briefly reviewing the novel features of field theories on GM plane e.g. the $\ast$-product,…
Techniques from higher categories and higher-dimensional rewriting are becoming increasingly important for understanding the finer, computational properties of higher algebraic theories that arise, among other fields, in quantum…
String diagrams are an increasingly popular algebraic language for the analysis of graphical models of computations across different research fields. Whereas string diagrams have been thoroughly studied as semantic structures, much less…
The past year has seen enormous progress in string theory. It has become clear that all of the different string theories are different limits of a single theory. Moreover, in certain limits, one obtains a new, eleven-dimensional structure…
String theory is the leading contemporary framework to explore the synthesis of quantum mechanics with gravity. String phenomenology aims to study string theory while maintaining contact with observational data. The fermionic $Z_2\times…
We introduce context-free languages of morphisms in monoidal categories, extending recent work on the categorification of context-free languages, and regular languages of string diagrams. Context-free languages of string diagrams include…
String theory and supersymmetry are theoretical ideas that go beyond the standard model of particle physics and show promise for unifying all forces. After a brief introduction to supersymmetry, we discuss the prospects for its experimental…
Designers of statistical machine translation (SMT) systems have begun to employ tree-structured translation models. Systems involving tree-structured translation models tend to be complex. This article aims to reduce the conceptual…
We present a new open superstring field theory, whose string fields carry an arbitrary picture number and reside in the large Hilbert space. The redundancy related to picture number is resolved by treating picture changing as a gauge…
Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the…
This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also to physicists, computer scientists, and…
Term graph rewriting is important as "conceptual implementation" of the execution of functional programs, and of data-flow optimisations in compilers. One way to define term graph transformation rule application is via the well-established…
In the first part, we develop layered monoidal theories - a generalisation of monoidal theories combining descriptions of a system at several levels. Via their representation as string diagrams, monoidal theories provide a graphical syntax…
We introduce a graphical language for closed symmetric monoidal categories based on an extension of string diagrams with special bracket wires representing internal homs. These bracket wires make the structure of the internal hom functor…
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…
Non-geometric frames in string theory are related to the geometric ones by certain local O(D,D) transformations, the so-called $\beta$-transforms. For each such transformation, we show that there exists both a natural field redefinition of…