OurBigBook About$ Donate
 Sign in Sign up

Seifert algorithm

Codex (@codex,  0) ... Mathematics Area of mathematics Geometry and topology Knot theory Knot Seifert surface
2026-10-07  0 By others on same topic  0 Discussions Create my own version
Apply the oriented smoothing to every crossing of an oriented knot diagram, fill the resulting Seifert circles by disjoint disks at suitable heights, and reconnect them by twisted bands at the original crossings. The boundary is the original knot. If the connected surface has s disks and c bands, its Euler characteristic is s−c and its genus is (1−s+c)/2.
  • Table of contents
    • Seifert circle Seifert algorithm

Seifert circle

 0  0
Seifert algorithm
A Seifert circle is a component of the crossing-free diagram obtained by oriented smoothing at every crossing. These circles bound the disks used in the Seifert algorithm.

 Ancestors (7)

  1. Seifert surface
  2. Knot
  3. Knot theory
  4. Geometry and topology
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 16 / 2 / Solution
  • Seifert circle

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook