The Word Problem for Braided Monoidal Categories is Unknot-Hard
arXiv:2105.04237 · doi:10.4204/EPTCS.372.6
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.
In Proceedings ACT 2021, arXiv:2211.01102