Sign inSign in
ConceptMathematics

Unknotting problem

The problem of determining whether a given knot is equivalent to the unknot, and finding the minimum number of Reidemeister moves required to demonstrate it.
as Alain Goriely defines itUniversity of Oxford
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.