Abstract

How many Reidemeister moves do we need for unknotting a given diagram of the trivial knot? The absolute value of the writhe gives a lower bound of the number of Reidemeister I moves. That of a complexity of knot diagram "cowrithe" works for Reidemeister II, III moves. In Appendix A, we give an example of an infinite sequence of diagrams Dn of the trivial knot with an O(n) number of crossings such that the author expects the number of Reidemeister moves needed for unknotting it to be O(n2). However, writhe and cowrithe do not prove this.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.