Computing The Linking Number
There is an algorithm to compute the linking number of two curves from a link diagram. Label each crossing as positive or negative, according to the following rule:
The total number of positive crossings minus the total number of negative crossings is equal to twice the linking number. That is:
where n1, n2, n3, n4 represent the number of crossings of each of the four types. The two sums and are always equal, which leads to the following alternative formula
Note that involves only the undercrossings of the blue curve by the red, while involves only the overcrossings.
Read more about this topic: Linking Number
Famous quotes containing the word number:
“This nightmare occupied some ten pages of manuscript and wound off with a sermon so destructive of all hope to non-Presbyterians that it took the first prize. This composition was considered to be the very finest effort of the evening.... It may be remarked, in passing, that the number of compositions in which the word “beauteous” was over-fondled, and human experience referred to as “life’s page,” was up to the usual average.”
—Mark Twain [Samuel Langhorne Clemens] (1835–1910)