The word problem for braided monoidal categories is unknot-hard

zbMATH Open1530.68122arXiv2105.04237MaRDI QIDQ6153328FDOQ6153328

Authors: Antonin Delpeuch, Jamie Vicary 

Publication date: 13 February 2024

Full work available at URL: https://arxiv.org/abs/2105.04237

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

Mathematics Subject Classification ID

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

Cites Work

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

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)