Prefer a chat interface with context about you and your work?
The Word Problem for Braided Monoidal Categories is Unknot-Hard
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.