Decidability of the word problem for Gray categories and braided monoidal categories
Statement
Let the word problem for 3-cells of Gray categories be the problem of deciding whether two such cells are equal, and likewise let the word problem for cells of braided monoidal categories be the problem of deciding whether two such cells are equal. Decidability conjecture. The word problem for 3-cells of Gray categories, and hence for cells of braided monoidal categories, is decidable. The paper establishes that these word problems are at least as hard as the unknotting problem; no algorithm for the braided monoidal word problem is known to date, so decidability remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.