Site-specific gordian distances of spatial graphs

Research output: Contribution to journalArticlepeer-review

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.

Primary 57M25, Secondly 57M15

Original languageEnglish
JournalUnknown Journal
Publication statusPublished - 2017 Mar 28

Keywords

  • Covering space
  • Knot
  • Link
  • Milnor link
  • Puzzle ring
  • Site-specific Gordian distance
  • Spatial graph

ASJC Scopus subject areas

  • General

Fingerprint Dive into the research topics of 'Site-specific gordian distances of spatial graphs'. Together they form a unique fingerprint.

Cite this