Related papers: Propification and the Scalable Comonad
Higher-dimensional category theory is the study of n-categories, operads, braided monoidal categories, and other such exotic structures. Although it can be treated purely as an algebraic subject, it is inherently topological in nature: the…
A growing body of research on probabilistic programs and causal models has highlighted the need to reason compositionally about model classes that extend directed graphical models. Both probabilistic programs and causal models define a…
We study Question 7.9 in the paper "Monoids in the mapping class group" by Etnyre and Van Horn-Morris; whether a symmetric mapping class admitting a positive factorization is a lift of a quasi-positive braid. We answer affirmatively for…
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…
The free monoid $A^*$ on a finite totally ordered alphabet $A$ acts at the left on columns, by Schensted left insertion. This defines a finite monoid, denoted $Styl(A)$ and called the stylic monoid. It is canonically a quotient of the…
With a view on applications in computing, in particular concurrency theory and higher-dimensional rewriting, we develop notions of $n$-fold monoid and comonoid objects in $n$-fold monoidal categories and bicategories. We present a series of…
In this manuscript we prove that if two cuspidal plane curves have equivalent braid monodromy factorizations, then they are smoothly isotopic in the plane. As a consequence of this and the Chisini conjecture, we obtain that if two…
The aim of this paper is to connect two important and apparently unrelated theories: motivic homotopy theory and ramification theory. We construct motivic homotopy categories over a qcqs base scheme $S$, in which cohomology theories with…
We construct a symmetric monoidal category $LIE^{MC}$ whose objects are shifted L-infinity algebras equipped with a complete descending filtration. Morphisms of this category are "enhanced" infinity morphisms between shifted L-infinity…
In this work, we establish a representation theorem for multivariable totally symmetric functions: a multisymmetric continuous function must be the composition of a continuous function and a set of generators of the multisymmetric…
We study categories whose objects are the braid representations, i.e. strict monoidal functors $F\colon B\rightarrow Mat$ from the braid category $B$ to the category of matrices $Mat$. Braid representations are equivalent to solutions to…
Diagrammatic reasoning using string diagrams provides an intuitive language for reasoning about morphisms in a symmetric monoidal category. To allow working with infinite families of string diagrams, !-graphs were introduced as a method to…
A graph $G = (V,E)$ is word-representable if there is a word $w$ over the alphabet $V$ such that $x$ and $y$ alternate in $w$ if and only if the edge $(x, y)$ is in $G$. It is known [6] that all $3$-colourable graphs are word-representable,…
Category theory unifies mathematical concepts, aiding comparisons across structures by incorporating objects and morphisms, which capture their interactions. It has influenced areas of computer science such as automata theory, functional…
We develop the Scott model of the programming language PCF in univalent type theory. Moreover, we work constructively and predicatively. To account for the non-termination in PCF, we use the lifting monad (also known as the partial map…
If $\mathcal{C}$ is a cocomplete monoidal category in which tensoring from both sides preserves coequalizers, then the category of monoids over $\mathcal{C}$ is cocomplete. The same holds if $\mathcal{C}$ has regular factorizations and…
We define (iterated) coisotropic correspondences between derived Poisson stacks, and construct symmetric monoidal higher categories of derived Poisson stacks where the $i$-morphisms are given by $i$-fold coisotropic correspondences.…
It has long been known that every weak monoidal category A is equivalent via monoidal functors and monoidal natural transformations to a strict monoidal category st(A). We generalise the definition of weak monoidal category to give a…
This article shows that the units of a skew monoidal category are unique up to a unique isomorphism, and internalises this fact to skew monoidales. Some benefits of certain extra structure on the unit maps are also discussed before the…
The three-way table problem is to decide if there exists an l x m x n table satisfying given line sums, and find a table if there is one. It is NP-complete already for l=3 and every bounded integer program can be isomorphically represented…