Related papers: String Diagram Rewrite Theory I: Rewriting with Fr…
Over the last few years, string theory has changed profoundly. Most importantly, novel duality relations have emerged which involve gauge theories of brane excitations on one side and various closed string backgrounds on the other. In this…
We develop a procedure that reorganizes the perturbative expansion in a class of quantum field theories into a stringy amplitude expressed as a sum over two-dimensional geometries. Using Schwinger parametrization and the one-to-one…
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…
Configurations of fivebranes, twobranes and fourbranes in type IIA string theory, which give (1+1) dimensional supersymmetric gauge theories in the low energy limit, are constructed. It is shown that these brane configurations are…
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…
String theories should reduce to ordinary four-dimensional field theories at low energies. Yet the formulation of the two are so different that such a connection, if it exists, is not immediately obvious. With the Schwinger proper-time…
We present a computational implementation of diagrammatic sets, a model of higher-dimensional diagram rewriting that is "topologically sound": diagrams admit a functorial interpretation as homotopies in cell complexes. This has potential…
We introduce proof terms for string rewrite systems and, using these, show that various notions of equivalence on reductions known from the literature can be viewed as different perspectives on the notion of causal equivalence. In…
An arbitrary Feynman graph for string field theory interactions is analysed and the homeomorphism type of the corresponding world sheet surface is completely determined even in the non-orientable cases. Algorithms are found to mechanically…
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…
Currently, string theory represents the only advanced approach to a unification of all interactions, including gravity. In spite of the more than thirty years of its existence it did not make any empirically testable predictions. And it is…
Dominant sequence models like the Transformer represent structure implicitly through dense attention weights, incurring quadratic complexity. We propose RewriteNets, a novel neural architecture built on an alternative paradigm: explicit,…
String breaking is one of the most representative non-perturbative dynamics processes in confinement theory, typically associated with the creation of particle-antiparticle pairs. In this paper, we take a one-dimensional Rydberg atomic…
We review some of the recent developments in the construction of $W$-string theories. These are generalisations of ordinary strings in which the two-dimensional ``worldsheet'' theory, instead of being a gauging of the Virasoro algebra, is a…
Over the recent years, the theory of rewriting has been used and extended in order to provide systematic techniques to show coherence results for strict higher categories. Here, we investigate a further generalization to Gray categories,…
This chapter is an introduction to the Free Fermionic Formulation of String Theory, with emphasis on heterotic model building. After a brief review of bosonization in two dimensional conformal field theories, we discuss how internal bosonic…
A series of works has established rewriting as an essential tool in order to prove coherence properties of algebraic structures, such as MacLane's coherence theorem for monoidal categories, based on the observation that, under reasonable…
A popular graphical calculus for monoidal categories makes computations tactile and intuitive. Complicated diagram chases can be expressed in a few pictures and discovered by playing with a shoelace. Joyal and Street's proof of the…
Higher-dimensional rewriting is founded on a duality of rewrite systems and cell complexes, connecting computational mathematics to higher categories and homotopy theory: the two sides of a rewrite rule are two halves of the boundary of an…
This thesis details a project to define a fully compositional theory of synchronous sequential circuits built from primitive components, motivated by applying techniques successfully used in programming languages to hardware. The first part…