A lower bound of the crossing number of composite knots
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.