Detecting Unknots via Equational Reasoning, I: Exploration

DOI10.1007/978-3-319-08434-3_7zbMath1304.68153arXiv1405.4211OpenAlexW1840991433MaRDI QIDQ5495915

Andrew Fish, Alexej P. Lisitsa

Publication date: 7 August 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Related Items (4)

Dihedral semigroups, their defining relations and an application to describing knot semigroups of rational links ⋮ The 11th IJCAR automated theorem proving system competition – CASC-J11 ⋮ Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT ⋮ Visual Algebraic Proofs for Unknot Detection

Uses Software

• Prover9
• Mace4
• KnotInfo
• MathOverflow

Cites Work

• Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
• Simple quandles
• A classifying invariant of knots, the knot quandle
• Proof theory and automated deduction
• Knottedness is in NP, modulo GRH
• Automated model building
• The computational complexity of knot and link problems
• Three dimensional manifolds, Kleinian groups and hyperbolic geometry
• RACKS AND LINKS IN CODIMENSION TWO
• Recognition algorithms in knot theory
• Unnamed Item
• Unnamed Item

This page was built for publication: Detecting Unknots via Equational Reasoning, I: Exploration