Related papers: Timing via Pinwheel Double Categories

We present a formalization in Lean 4, within the framework of the mathematical library Mathlib, of the unbiasing process for symmetric monoidal categories. This is realized by extending the data of a symmetric monoidal category to a…

In this paper we present cartesian structure for symmetric Gray-monoidal double categories. To do this we first introduce locally cubical Gray categories, which are three-dimensional categorical structures analogous to classical, locally…

Traced monoidal categories are used to model processes that can feed their outputs back to their own inputs, abstracting iteration. The category of finite dimensional Hilbert spaces with the direct sum tensor is not traced. But…

We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…

We reformulate recent advances in directed type theory--a type theory where the types have the structure of synthetic (higher) categories--as a logical calculus with multiple context 'zones', following the example of Pfenning and Davies.…

String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the modelling of various computational structures, in fields as…

This paper develops a systematic framework for integrating local categories that model logical connectives using higher category theory. By extending these local categories into a unified two-category enriched with natural isomorphisms, the…

We provide a complete generators and relations presentation of the 2-dimensional extended unoriented and oriented bordism bicategories as symmetric monoidal bicategories. Thereby we classify these types of 2-dimensional extended topological…

The monoidal category of Soergel bimodules can be thought of as a categorification of the Hecke algebra of a finite Weyl group. We present this category, when the Weyl group is the symmetric group, in the language of planar diagrams with…

We introduce a general categorical framework to reason about quantum theory and other process theories living in spacetimes where Closed Timelike Curves (CTCs) are available, allowing resources to travel back in time and provide…

In the context of higher gauge theory, we construct a flat and fake flat 2-connection, in the configuration space of $n$ particles in the complex plane, categorifying the Knizhnik-Zamolodchikov connection. To this end, we define the…

We discuss what it means for a symmetric monoidal category to be a module over a commutative semiring category. Each of the categories of (1) cartesian monoidal categories, (2) semiadditive categories, and (3) connective spectra can be…

We introduce string diagrams as a formal mathematical, graphical language to represent, compose, program and reason about games. The language is well established in quantum physics, quantum computing and quantum linguistic with the…

Multiplier bimonoids (or bialgebras) in arbitrary braided monoidal categories are defined. They are shown to possess monoidal categories of comodules and modules. These facts are explained by the structures carried by their induced…

We investigate unoriented strings and superstrings in two dimensions and their dual matrix quantum mechanics. Most of the models we study have a tachyon tadpole coming from the RP^2 worldsheet which needs to be cancelled by a…

The field of directed type theory seeks to design type theories capable of reasoning synthetically about (higher) categories, by generalizing the symmetric identity types of Martin-L\"of Type Theory to asymmetric hom-types. We articulate…

Critical pair analysis provides a convenient and computable criterion of confluence, which is a fundamental property in rewriting theory, for a wide variety of rewriting systems. Bonchi et al. showed validity of critical pair analysis for…

It is well known that braided monoidal categories are the categorical algebras of the little two-dimensional disks operad. We introduce involutive little disks operads, which are Z/2Z-orbifold versions of the little disks operads. We…

Algorithms which learn environments represented by automata in the past have had complexity scaling with the number of states in the automaton, which can be exponentially large even for automata recognizing regular expressions with a small…

This paper considers synchronous discrete-time dynamical systems on graphs based on the threshold model. It is well known that after a finite number of rounds these systems either reach a fixed point or enter a 2-cycle. The problem of…