Papers
Topics
Authors
Recent
Search
2000 character limit reached

1-domination of knots

Published 22 Nov 2015 in math.AT and math.GT | (1511.07073v1)

Abstract: We say that a knot k1k_1 in the $3$-sphere {\it $1$-dominates} another k2k_2 if there is a proper degree 1 map E(k1)→E(k2)E(k_1) \to E(k_2) between their exteriors, and write k1≥k2k_1 \ge k_2. When k1≥k2k_1 \ge k_2 but k1≠k2k_1 \ne k_2 we write $k_1 > k_2$. One expects in the latter eventuality that k1k_1 is more {\it complicated}. In this paper we produce various sorts of evidence to support this philosophy.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.