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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
