The Word Problem for Braided Monoidal Categories is Unknot-Hard
Category Theory
2022-11-04 v2
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.
Keywords
Cite
@article{arxiv.2105.04237,
title = {The Word Problem for Braided Monoidal Categories is Unknot-Hard},
author = {Antonin Delpeuch and Jamie Vicary},
journal= {arXiv preprint arXiv:2105.04237},
year = {2022}
}
Comments
In Proceedings ACT 2021, arXiv:2211.01102