arXiv · 1703.09440
Site-specific Gordian distances of spatial graphs
Abstract
A site-specific Gordian distance between two spatial embeddings of an abstract graph is the minimal number of crossing changes from one to another where each crossing change is performed between two previously specified abstract edges of the graph. It is infinite in some cases. We determine the site-specific Gordian distance between two spatial embeddings of an abstract graph in certain cases. It has an application to puzzle ring problem. The site-specific Gordian distances between Milnor links and trivial links are determined. We use covering space theory for the proofs.
Explore related subjects
Keep this discovery
Kouki Taniyama. 2017-03-28. Site-specific Gordian distances of spatial graphs. https://arxiv.org/abs/1703.09440
Cite the original work for its findings. Save a collection to share your selection of sources.