Journal article
Deh s algorithm for simple diagrams
Journal of knot theory and its ramifications, Vol.24(14), 1550074
12/01/2015
DOI: 10.1142/S0218216515500741
Abstract
Dehn gave an algorithm for deciding if two cyclic words in the standard presentation of the fundamental group of a closed oriented surface of positive genus represent the same conjugacy class. A simple diagram on a surface is a disjoint union of simple closed curves none of which bound a disk. If F is a once punctured closed surface of negative Euler characteristic, simple diagrams are classified up to isotopy by their geometric intersection numbers with the edges of an ideal triangulation of F. Simple diagrams on the unpunctured surface F can be represented by simple diagrams on F. The weight of a simple diagram is the sum of its geometric intersection numbers with the edges of the triangulation. We show that you can pass from any representative to a least weight representative via a sequence of elementary moves, that monotonically decrease weights. This leads to a geometric analog of Dehn's algorithm for simple diagrams.
Details
- Title: Subtitle
- Deh s algorithm for simple diagrams
- Creators
- Charles Frohman - University of IowaJoanna Kania-Bartoszynska - U.S. National Science Foundation
- Resource Type
- Journal article
- Publication Details
- Journal of knot theory and its ramifications, Vol.24(14), 1550074
- DOI
- 10.1142/S0218216515500741
- ISSN
- 0218-2165
- eISSN
- 1793-6527
- Publisher
- WORLD SCIENTIFIC PUBL CO PTE LTD
- Number of pages
- 12
- Language
- English
- Date published
- 12/01/2015
- Academic Unit
- Mathematics
- Record Identifier
- 9984241159502771
Metrics
32 Record Views