To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.

Dowker notation

From Wikipedia, the free encyclopedia

A knot diagram with crossings labelled for a Dowker sequence
A knot diagram with crossings labelled for a Dowker sequence

In the mathematical field of knot theory, the Dowker notation, also called the Dowker–Thistlethwaite notation or code, for a knot is a sequence of even integers. The notation is named after Clifford Hugh Dowker and Morwen Thistlethwaite, who refined a notation originally due to Peter Guthrie Tait.

YouTube Encyclopedic

  • 1/3
    2 021
    252 998
    1 660
  • ✪ Math Encounters - Blown Away: What Knot to Do When Sailing (Presentation)
  • ✪ Einstein's Field Equations of General Relativity Explained
  • ✪ Introduction to Diagrams and Reidemeister Moves




To generate the Dowker notation, traverse the knot using an arbitrary starting point and direction. Label each of the n crossings with the numbers 1, ..., 2n in order of traversal (each crossing is visited and labelled twice), with the following modification: if the label is an even number and the strand followed crosses over at the crossing, then change the sign on the label to be a negative. When finished, each crossing will be labelled a pair of integers, one even and one odd. The Dowker notation is the sequence of even integer labels associated with the labels 1, 3, ..., 2n − 1 in turn.


For example, a knot diagram may have crossings labelled with the pairs (1, 6) (3, −12) (5, 2) (7, 8) (9, −4) and (11, −10). The Dowker notation for this labelling is the sequence: 6 −12 2 8 −4 −10.

Uniqueness and counting

A knot can be recovered from a Dowker sequence, but the recovered knot may differ from the original by being a reflection or (more generally) by having any connected sum component reflected in the line between its entry/exit points – the Dowker notation is unchanged by these reflections. Knots tabulations typically consider only prime knots and disregard chirality, so this ambiguity does not affect the tabulation.

The ménage problem, posed by Tait, concerns counting the number of different number sequences possible in this notation.

See also

Further reading

  • Adams, Colin Conrad (2001). The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots. Providence, R.I.: American Mathematical Soc. ISBN 978-0-8218-3678-1.
  • Dowker, C. H.; Morwen B. Thistlethwaite (1983). "Classification of knot projections". Topology and its Applications. 16 (1): 19–31. doi:10.1016/0166-8641(83)90004-4..

External links

This page was last edited on 16 December 2018, at 20:35
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.