Abstract
How many edges are necessary and sufficient to construct a knot of type K in the cubic lattice? Define the minimal edge number of a knot to be this number of edges. To what extend does the minimal edge number measure the complexity of a knot? What is the behaviour of the minimal edge number under the connected sum of knots, and what is its limiting behaviour? We consider these questions and show that the minimal edge number may be computed using simulated annealing.
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.
