18 citations · 50 across the 9 of their papers we have counts for
5 papers · 1 filter
The free compact closure of a symmetric monoidal category
Antonin Delpeuch
We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagra…
The Word Problem for Braided Monoidal Categories is Unknot-Hard
Antonin Delpeuch, Jamie Vicary
We show that the word problem for braided monoidal categories is at least as hard as the unknotting problem. As a corollary, so is the word problem for Gray categories. We conjectu…
Sheet diagrams for bimonoidal categories
Cole Comfort, Antonin Delpeuch, Jules Hedges
Bimonoidal categories (also known as rig categories) are categories with two monoidal structures, one of which distributes over the other. We formally define sheet diagrams, a grap…
The word problem for double categories
Antonin Delpeuch
We solve the word problem for free double categories without equations between generators by translating it to the word problem for 2-categories. This yields a quadratic algorithm…
Autonomization of Monoidal Categories
Antonin Delpeuch
We show that contrary to common belief in the DisCoCat community, a monoidal category is all that is needed to define a categorical compositional model of natural language. This re…