Towards human readability of automated unknottedness proofs

Fish, A, Lisitsa, A and Vernitski, A
(2018) Towards human readability of automated unknottedness proofs. .

[img] Text
Towards_human_readability_of_automated_unknottedness_proofs.pdf - Author Accepted Manuscript

Download (128kB)


© 2018 CEUR-WS. All rights reserved. When is a knot actually unknotted? How does one convince a human reader of the correctness of an answer to this question for a given knot diagram? For knots with a small number of crossings, humans can be efficient in spotting a sequence of untangling moves. However, for knot diagrams with hundreds of crossings, computer assistance is necessary. There have been recent developments in algorithms for both (indirectly) (i) detecting unknotedness and (directly) (ii) producing such sequences of untangling moves. Automated reasoning can be applied to (i) and, to some extent, (ii), but the computer output is not necessarily human-readable. We report on work in progress towards bridging the gap between the computer output and human readability, via generating human-readable visual proofs of unknottedness.

Item Type: Conference or Workshop Item (Unspecified)
Depositing User: Symplectic Admin
Date Deposited: 15 Jan 2019 15:12
Last Modified: 19 Jan 2023 01:06
Related URLs: