Related papers: String diagrams and categorification
We describe quantizations on monoidal categories of modules over finite groups. They are given by quantizers which are elements of a group algebra. Over the complex numbers we find these explicitly. For modules over S3 and A4 we are given…
We introduce a novel compositional description of Feynman diagrams, with well-defined categorical semantics as morphisms in a dagger-compact category. Our chosen setting is suitable for infinite-dimensional diagrammatic reasoning,…
We introduce the category of finite strings and study its basic properties. The category is closely related to the augmented simplex category, and it models categories of linear representations. Each lattice of non-crossing partitions…
The purpose of these notes is to collect in one place some facts on the category of finite totally ordered sets and some related categories. More specifically, we collect some results on them which will be useful for the study of iteratedly…
String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs…
The main purpose of these lectures is to give a pedagogical overview on the possibility to classify and relate off-shell linear supermultiplets in the context of supersymmetric mechanics. A special emphasis is given to a recent graphical…
Spin networks, essentially labeled graphs, are ``good quantum numbers'' for the quantum theory of geometry. These structures encompass a diverse range of techniques which may be used in the quantum mechanics of finite dimensional systems,…
These are extended notes of a course given at Tulane University for the 2015 Clifford Lectures. Their aim is to present structure results for group schemes of finite type over a field, with applications to Picard varieties and automorphism…
In this paper, we apply the theory of cluster algebras to study minimal affinizations for the quantum affine algebra of type $F_4$. We show that the $q$-characters of a large family of minimal affinizations of type $F_4$ satisfy a system of…
This book provides an introduction to string field theory (SFT). String theory is usually formulated in the worldsheet formalism, which describes a single string (first-quantization). While this approach is intuitive and could be pushed far…
This note gives generators and relations for the strict monoidal category of probabilistic maps on finite cardinals (i.e., stochastic matrices).
We use the string diagram calculus to give graphical proofs of the basic results of Etingof, Nikshych and Ostrik on fusion categories. These results include: the quadruple dual is canonically isomorphic to the identity, positivity of the…
In this paper we introduce and investigate the notions of diagrams and discrete extensions in the study of finitary $2$-representations of finitary $2$-categories.
These are the lecture notes of the introductory String Theory course held by one of the authors for the master program of Theoretical Physics at Turin University. The world-sheet approach to String Theory is pedagogically introduced in the…
In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A representation of a graph from that class is given by the set of…
Graph Neural Networks (GNNs) are prominent in handling sparse and unstructured data efficiently and effectively. Specifically, GNNs were shown to be highly effective for node classification tasks, where labelled information is available for…
Tape diagrams provide a convenient notation for arrows of rig categories, i.e., categories equipped with two monoidal products, $\oplus$ and $\otimes$, where $\otimes$ distributes over $\oplus $. In this work, we extend tape diagrams with…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or discarded at will. In SMTs, traditional tree-like terms are…