{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/computing-euclidean-belyi-maps","title":"Computing Euclidean Belyi maps","arxiv_id":"2111.07504","date":"2021-11-15","proceeding":null,"authors":["Matthew Radosevich","John Voight"],"abstract":"We exhibit an explicit algorithm to compute three-point branched covers of the complex projective line when the uniformizing triangle group is Euclidean.","url_abs":"https://arxiv.org/abs/2111.07504v2","url_pdf":"https://arxiv.org/pdf/2111.07504v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"computing-euclidean-belyi-maps","repo_url":"https://github.com/michaelmusty/belyi","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}