2000 character limit reached
Additivity of Crossing Number via Restricted Reidemeister Moves (2511.18016v1)
Published 22 Nov 2025 in math.GT and math.CO
Abstract: We define a set of restricted Reidemeister moves and show that if $K$ is obtained from $K_0\,#\,K_1$ using those moves, then the crossing number of $K$ is at least $c(K_0)+c(K_1)$. We also explore topological interpretations of this result.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.