A lower bound of the crossing number of composite knots

Published 15 Jul 2024 in math.GT | (2407.10467v1)

Abstract: Let $c(K)$ denote the crossing number of a knot $K$ and let $K_1# K_2$ denote the connected sum of two oriented knots $K_1$ and $K_2$. It is a very old unsolved question that whether $c(K_1# K_2)=c(K_1)+c(K_2)$. In this paper we show that $c(K_1# K_2)> (c(K_1)+c(K_2))/16$.

Abstract PDF HTML Upgrade to Chat

Authors (2)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

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

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

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.

Collections

Sign up for free to add this paper to one or more collections.