10.1007/s10711-020-00593-9">
 

Title

Rationality is decidable for nearly Euclidean Thurston maps

Document Type

Article

Publication Date

2021

Department/School

Mathematics

Publication Title

Geometriae Dedicata

Abstract

Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound C, there are finitely many diagrams of size at most C. Given a NET map F presented by a diagram of size at most C, the problem of determining whether F is equivalent to a rational function is, in theory, a finite computation. We give bounds for the size of this computation in terms of C and one other natural geometric quantity. This result partially explains the observed effectiveness of the computer program NETmap in deciding rationality.

Link to Published Version

10.1007/s10711-020-00593-9

Share

COinS