A lower bound of the crossing number of composite knots
Ruifeng QiuChao Wang
所有作者
Ruifeng QiuChao Wang
文献摘要
Let c(K) denote the crossing number of a knot K and let K1#K2 denote the connected sum of two oriented knots K1 and K2. It is a very old unsolved question that whether c(K1#K2)=c(K1)+c(K2). In this paper we show that c(K1#K2)>(c(K1)+c(K2))/16.