The $n$-adjacency graph for knots

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Campisi, Marion, Doleshal, Brandy, Staron, Eric
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913103410626560
author Campisi, Marion
Doleshal, Brandy
Staron, Eric
author_facet Campisi, Marion
Doleshal, Brandy
Staron, Eric
contents A knot $K$ is called $n$-adjacent to a knot $K'$ if there is a set of $n$ crossing circles $\mathcal C$ in $K$ so that a generalized crossing change at any nonempty subset of crossings in $\mathcal C$ yields $K'$. In this paper, the authors define a new graph $Γ_n$ to represent $n$-adjacency relationships between knots. We prove several results about this new object.
format Preprint
id arxiv_https___arxiv_org_abs_2603_08597
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle The $n$-adjacency graph for knots
Campisi, Marion
Doleshal, Brandy
Staron, Eric
Geometric Topology
57K10, 57M15
A knot $K$ is called $n$-adjacent to a knot $K'$ if there is a set of $n$ crossing circles $\mathcal C$ in $K$ so that a generalized crossing change at any nonempty subset of crossings in $\mathcal C$ yields $K'$. In this paper, the authors define a new graph $Γ_n$ to represent $n$-adjacency relationships between knots. We prove several results about this new object.
title The $n$-adjacency graph for knots
topic Geometric Topology
57K10, 57M15
url https://arxiv.org/abs/2603.08597