MOVES ON CURVES ON NONORIENTABLE SURFACES
No Thumbnail Available
Date
2022
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Rocky Mt Math Consortium
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
Let Ng,n denote a nonorientable surface of genus g with n punctures and one boundary component. We give an algorithm to calculate the geometric intersection number of an arbitrary multicurve d. with so-called relaxed curves in Ng,n making use of measured n1-train tracks. The algorithm proceeds by the repeated application of three moves which take as input the measures of d. and produces as output a multicurve d.' which is minimal with respect to each of the relaxed curves. The last step of the algorithm calculates the number of intersections between d.' and the relaxed curves.
Description
Keywords
geometric intersection, multicurves, ? 1-train tracks
Turkish CoHE Thesis Center URL
Fields of Science
Citation
0
WoS Q
Q3
Scopus Q
Source
Volume
52
Issue
6
Start Page
1957
End Page
1967