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 in the $3$-sphere {\it $1$-dominates} another if there is a proper degree 1 map between their exteriors, and write . When but we write $k_1 > k_2$. One expects in the latter eventuality that is more {\it complicated}. In this paper we produce various sorts of evidence to support this philosophy.
Paper Prompts
Sign up for free to create and run prompts on this paper.