De Öykü Yurttas
Multicurves have played a fundamental role in the study of mapping class groups of surfaces since the work of Dehn. A beautiful method of describing such systems on the n-punctured disk is given by the Dynnikov coordinate system. In this talk we describe polynomial time algorithms for calculating the number of connected components of a multi curve, and the geometric intersection number of two multicurves on the n-punctured disk, taking as input their Dynnikov coordinates. This is joint work with Toby Hall.
De Pascal Hubert
De Pascal Hubert
De Christopher Leininger
De Alex Wright
De Anna Lenzhen
De Christopher Leininger
De Christopher Leininger
De Sasha Skripchenko
De Sasha Skripchenko
De Rodolfo Gutierrez
De Anton Zorich
De Anton Zorich
De Anton Zorich
De Vaibhav Gadre
De Irene Pasquinelli
De Olga Paris-Romaskevich
