Related papers: String Diagram Rewrite Theory I: Rewriting with Fr…
In this note we reformulate topological string theory using supermanifolds and supermoduli spaces, following the approach worked out by Witten for superstring perturbation theory in arXiv:1209.5461. We intend to make the construction…
For correlators in $\mathcal{N}=4$ Super Yang-Mills preserving half the supersymmetry, we manifestly recast the gauge theory Feynman diagram expansion as a sum over dual closed strings. Each individual Feynman diagram maps on to a Riemann…
The correspondence between monoidal categories and graphical languages of diagrams has been studied extensively, leading to applications in quantum computing and communication, systems theory, circuit design and more. From the categorical…
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…
These are lectures notes for a mini-course given at the conference Interactions of Quantum Affine Algebras with Cluster Algebras, Current Algebras, and Categorification in June 2018. The goal is to introduce the reader to string diagram…
We use string-net models to accomplish a direct, purely two-dimensional, approach to correlators of two-dimensional rational conformal field theories. We obtain concise geometric expressions for the objects describing bulk and boundary…
A well-known connection between n strings winding around a circle and permutations of n objects plays a fundamental role in the string theory of large N two dimensional Yang Mills theory and elsewhere in topological and physical string…
In this paper, which is a revised version of the author's PhD thesis, we analyze two different applications of string theory. In the first part, we focus on four dimensional compactifications of Type II string theories preserving N=1…
This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…
Complex structures are determined for surfaces with $S^2$ and $T^2$ topologies generated by the dynamical triangulation method. For a surface with $S^2$ topology the spacial distribution of the conformal mode is obtained, while for the case…
The string-matching field has grown at a such complicated stage that various issues come into play when studying it: data structure and algorithmic design, database principles, compression techniques, architectural features, cache and…
The `spider theorem' for a general Frobenius algebra $A$, classifies all maps $A^{\otimes m}\to A^{\otimes n}$ that are built from the operations and, in a graphical representation, represented by a {\it connected} diagram. Here the algebra…
Equality saturation, a technique for program optimisation and reasoning, has gained attention due to the resurgence of equality graphs (e-graphs). E-graphs represent equivalence classes of terms under rewrite rules, enabling simultaneous…
We introduce a general diagrammatic theory of digital circuits, based on connections between monoidal categories and graph rewriting. The main achievement of the paper is conceptual, filling a foundational gap in reasoning syntactically and…
I describe how superstring theory may violate spin-statistics in an experimentally observable manner. Reviewing the basics of superstring interactions and how to utilize these to produce a statistical phase, I then apply these ideas to two…
We develop a theory of rewriting for structured cospans in order to extend compositional methods for modeling open networks. First, we introduce a category whose objects are structured cospans, and establish conditions under which it is…
In work of Fokkinga and Meertens a calculational approach to category theory is developed. The scheme has many merits, but sacrifices useful type information in the move to an equational style of reasoning. By contrast, traditional proofs…
We describe a set of methods to calculate gauge theory renormalization constants from string theory, all based on a consistent prescription to continue off shell open bosonic string amplitudes. We prove the consistency of our prescription…
This thesis provides an introduction to the various category theory ideas employed in topological quantum field theory. These theories are viewed as symmetric monoidal functors from topological cobordism categories into the category of…
Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure…