Papers
Topics
Authors
Recent
Search
2000 character limit reached

Linking numbers of Montesinos links

Published 18 Mar 2024 in math.GT | (2403.11512v1)

Abstract: The linking number of an oriented two-component link is an invariant indicating how intertwined the two components are. Tuler proved that the linking number of a two-component rational $\frac{p}{q}$-link is $$\sum{\frac{|p|}{2}}_{k=1} (-1){\big\lfloor (2k-1) \frac{q}{p} \big\rfloor }.$$ In this paper, we provide a simple proof the above result, and introduce the numerical algorithm to find linking numbers of rational links. Using this result, we find linking numbers between any two components in a Montesinos link.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

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

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.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.