Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
At linking number, I added a diagrammatic/combinatorial proof that the linking number is an integer, and hence that there must be an even number of crossings between a pair of components of a link. It is surprisingly hard to find a diagrammatic proof: the typical argument is geometric, using something like the Jordan curve theorem. I stumbled across the argument I have added yesterday and thought it was rather nice, so decided to add it here before I forget it!
1 to 1 of 1