Les personnes qui possèdent un compte PLM-Mathrice sont invités à l'utiliser.
23-25 octobre 2017
Université d'Angers
Europe/Paris timezone
Accueil > Timetable > Contribution details


Université d'Angers - L003.

Rationality is practically decidable for Nearly Euclidean Thurston maps.


  • Kevin PILGRIM

Auteurs principaux


A Thurston map $f: (S^2, P) \to (S^2, P)$ is \emph{nearly Euclidean} if its postcritical set $P$ has four points and each branch point is simple. We show that the problem of determining whether $f$ is equivalent to a rational map is algorithmically decidable, and we give a practical implementation of this algorithm. Executable code and data from 50,000 examples is tabulated at \url{https://www.math.vt.edu/netmaps/index.php}. This is joint work with W. Floyd and W. Parry.