An algorithm for constructing diagrams of two-bridge knots and links with period two

DOI10.1080/09720502.1998.10700247zbMATH Open0929.57002OpenAlexW1967739198MaRDI QIDQ4248044FDOQ4248044

Authors: Peter Kohn 

Publication date: 23 January 2000

Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720502.1998.10700247

Recommendations

• An algorithm to compute the Kauffman polynomial of 2-bridge knots
• Chebyshev diagrams for two-bridge knots
• ON 2-ADJACENCY RELATION OF TWO-BRIDGE KNOTS AND LINKS
• Representation of links by braids: A new algorithm
• Knot diagrams of treewidth two
• An algorithm to find braid representatives of links
• Bridges with pillars: A graphical calculus of knot algebra
• On the lexicographic degree of two-bridge knots
• Algorithmic simplification of knot diagrams: new moves and experiments
• The diagram approach in knot theory and applications to graph theory

zbMATH Keywords

linktwo-bridge knot

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)

Cited In (4)

• An algorithm to compute the Kauffman polynomial of 2-bridge knots
• Title not available (Why is that?)
• Chebyshev diagrams for two-bridge knots
• On Alexander-Conway polynomials of two-bridge links

This page was built for publication: An algorithm for constructing diagrams of two-bridge knots and links with period two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248044)