Counting intersections of normal curves

被引:0
|
作者
Dynnikov, Ivan [1 ]
机构
[1] Russian Acad Sci, Steklov Math Inst, 8 Gubkina Str, Moscow 119991, Russia
关键词
Mapping class group; Normal curve; Train track; Geometric intersection index;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the composition by an exotic matrix multiplication. An efficient solution of the word problem for mapping class groups of punctured surfaces is proposed, with efficiency understood in a more restrictive way than the most common one.(c) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页码:181 / 231
页数:51
相关论文
共 50 条