Abstract
By the Tait Flyping Conjecture, all possible minimal diagrams of an alternating knot are related by a finite sequence of flypes. We use this fact for an algorithm to produce all possible minimal diagrams of an oriented alternating prime knot type. Starting with any given oriented minimal alternating diagram of a prime knot, the algorithm performs flypes exhaustively until all other possible minimal diagrams of the oriented knot type have been produced. Results for all distinct alternating prime knot types up to 16 crossings are shown. In addition, prime knot families are discussed that have either a small or a very large number of distinct minimal diagrams.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
