The word problem for braided monoidal categories is unknot-hard

MaRDI QIDQ6153328zbMATH OpenFDO

Authors Antonin Delpeuch, Jamie Vicary

Publication date 13 February 2024

Full work available at URL https://arxiv.org/abs/2105.04237, https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?ACT2021.6

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Braided monoidal categories and ribbon categories (18M15)

Recommendations

• Categorified invariants and the braid group
• Composition problems for braids
• The unbearable hardness of unknotting
• scientific article; zbMATH DE number 517043
• NP-hard problems naturally arising in knot theory

Cites work

• scientific article; zbMATH DE number 3149985 (Why is no real title available?)
• scientific article; zbMATH DE number 3785805 (Why is no real title available?)
• scientific article; zbMATH DE number 3390004 (Why is no real title available?)
• A polynomial upper bound on Reidemeister moves
• A survey of graphical languages for monoidal categories
• Braided compact closed categories with applications to low dimensional topology
• Braided tensor categories
• Efficient solutions to the braid isotopy problem.
• On the Reidemeister Moves of a Classical Knot
• The geometry of tensor calculus. I
• The periodic table of \(n\)-categories. II: Degenerate tricategories
• The word problem for double categories
• Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
• Theory of braids

This page was built for publication: The word problem for braided monoidal categories is unknot-hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153328)