Site-specific Gordian distances of spatial graphs

Kouki Taniyama*

*Corresponding author for this work

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.

Original languageEnglish
Article number2141016
JournalJournal of Knot Theory and its Ramifications
Volume30
Issue number14
DOIs
Publication statusPublished - 2021 Dec 1

Keywords

  • Knot
  • Milnor link
  • covering space
  • link
  • puzzle ring
  • site-specific Gordian distance
  • spatial graph

ASJC Scopus subject areas

  • Algebra and Number Theory

Fingerprint

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

Cite this