Related papers: Graded String Diagrams for Imprecise Probability a…

The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an…

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…

A Bayesian approach to the classification problem is proposed in which random partitions play a central role. It is argued that the partitioning approach has the capacity to take advantage of a variety of large-scale spatial structures, if…

The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic…

We present a unified framework for categorical systems theory which packages a collection of open systems, their interactions, and their maps into a symmetric monoidal loose right module of systems over a symmetric monoidal double category…

We give a monoidal presentation of Coxeter and braid 2-groups, in terms of decorated planar graphs. This presentation extends the Coxeter presentation. We deduce a simple criterion for a Coxeter group or braid group to act on a category.

This paper gives an explicit description of the categorical operad whose algebras are precisely symmetric monoidal categories. This allows us to place the operad in a sequence of four, and therefore a sequence of four successively stricter…

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…

Abstract Meaning Representations (AMR) are a broad-coverage semantic formalism which represents sentence meaning as a directed acyclic graph. To train most AMR parsers, one needs to segment the graph into subgraphs and align each such…

Causal identification in causal Bayes nets (CBNs) is an important tool in causal inference allowing the derivation of interventional distributions from observational distributions where this is possible in principle. However, most existing…

We present a graded modal type theory, a dependent type theory with grades that can be used to enforce various properties of the code. The theory has $\Pi$-types, weak and strong $\Sigma$-types, natural numbers, an empty type, and a…

Like notions of process equivalence, behavioural preorders on processes come in many flavours, ranging from fine-grained comparisons such as ready simulation to coarse-grained ones such as trace inclusion. Often, such behavioural preorders…

We introduce a strategy to study irreducible representations of automorphism groups of finite modules over local rings. We prove that these automorphism groups fit in a hierarchy that facilitates a stratification of their irreducible…

We introduce a notion of parity for formal morphisms between invertible objects and use it to prove a corresponding coherence theorem. Parity is conceptually similar to the sign of underlying permutations, but not defined as such. To give…

In categorical realizability, it is common to construct categories of assemblies and categories of modest sets from applicative structures. These categories have structures corresponding to the structures of applicative structures. In the…

We study a class of parametrizations of convex cones of positive semidefinite matrices with prescribed zeros. Each such cone corresponds to a graph whose non-edges determine the prescribed zeros. Each parametrization in this class is a…

Let $\V$ be a symmetric monoidal model category and let $X$ be an object in $\V$. From this we can construct a new symmetric monoidal model category $Sp^{\Sigma}(\V,X)$ of symmetric spectra objects in $\V$ with respect to $X$, together with…

Gradualizing the Calculus of Inductive Constructions (CIC) involves dealing with subtle tensions between normalization, graduality, and conservativity with respect to CIC. Recently, GCIC has been proposed as a parametrized gradual type…

Completeness proofs in categorical semantics usually proceed by building a syntactic category whose composition is given by substitution. For untyped effectful Call-by-Value languages, this runs into a basic obstacle: there is no canonical…

Markov categories are the central framework for categorical probability theory. Many important concepts from probability theory can be formalized in terms of Markov categories. In particular, conditional probability distributions and Bayes'…