The Word Problem for Braided Monoidal Categories is Unknot-Hard

Antonin Delpeuch
(University of Oxford)
Jamie Vicary
(University of Cambridge)

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 conjecture that the word problem for Gray categories is decidable.

In Kohei Kishida: Proceedings of the Fourth International Conference on Applied Category Theory (ACT 2021), Cambridge, United Kingdom, 12-16th July 2021, Electronic Proceedings in Theoretical Computer Science 372, pp. 72–87.
Published: 3rd November 2022.

ArXived at: http://dx.doi.org/10.4204/EPTCS.372.6 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org