Computation of Gordian Distances and H2-Gordian Distances of Knots
Yugoslav journal of operations research, Tome 25 (2015) no. 1, p. 133
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
In this paper we discuss the possibility of computing unknotting number from
minimal knot diagrams, Bernhard-Jablan Conjecture, unknown knot distances between
non-rational knots and of searching minimal distances by using a graph with weighted
edges representing knot distances. Since topoizomerazes are enzymes involved in
changing crossing of DNA, knot distances can be used to study topoizomerazes actions.
We compute some undecided knot distances 1 known from the literature, and extend the
computations by computing knots with smoothing number one with at most n = 11
crossings and smoothing knot distances of knots with at most n = 9 crossings. All
computations are done in the program LinKnot, based on Conway notation and non-
minimal representations of knots.
Classification :
57M25, 57M27.
Keywords: Unknotting number, Gordian distances, Smoothing distances, Weighted graph
Keywords: Unknotting number, Gordian distances, Smoothing distances, Weighted graph
@article{YJOR_2015_25_1_a7,
author = {Ana Zekovi\'c},
title = {Computation of {Gordian} {Distances} and {H2-Gordian} {Distances} of {Knots}},
journal = {Yugoslav journal of operations research},
pages = {133 },
year = {2015},
volume = {25},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2015_25_1_a7/}
}
Ana Zeković. Computation of Gordian Distances and H2-Gordian Distances of Knots. Yugoslav journal of operations research, Tome 25 (2015) no. 1, p. 133 . http://geodesic.mathdoc.fr/item/YJOR_2015_25_1_a7/