The Word Problem for Braided Monoidal Categories is Unknot-Hard

Antonin Delpeuch, Jamie Vicary

Abstract

: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.
BibTeX
@inproceedings{delpeuch2021word,
  author = {Antonin Delpeuch and Jamie Vicary},
  title = {{The Word Problem for Braided Monoidal Categories is Unknot-Hard}},
  booktitle = {ACT},
  year = {2021},
  url = {https://openreview.net/forum?id=uhhs3M8Fxa},
}
Figure