Making curves minimally crossing by Reidemeister moves (Q1369656)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Making curves minimally crossing by Reidemeister moves |
scientific article; zbMATH DE number 1076875
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Making curves minimally crossing by Reidemeister moves |
scientific article; zbMATH DE number 1076875 |
Statements
Making curves minimally crossing by Reidemeister moves (English)
0 references
25 November 1997
0 references
A regular system of curves on a surface \(S\) is a continuous map \(C:kS^1\to S\) which has no triple points and which is an embedding off a finite set of double points. The main result of this paper is that any such regular system can be transformed to a regular system with minimal intersections and self-intersections by a series of ``Reidemeister'' moves. Moreover, this can be implemented via a finite algorithm.
0 references
intersection
0 references
Reidemeister move
0 references
surface
0 references
regular system of curves
0 references
