Algorithmic Construction of Hurwitz Maps

DOI10.1080/10586458.2013.860569zbMath1315.30002arXiv1303.1579OpenAlexW3099442300MaRDI QIDQ5246361

Hans-Christian Graf von Bothmer, Jakob Kröker, Laurent Bartholdi, Xavier Buff

Publication date: 21 April 2015

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.1579

zbMATH Keywords

uniformizationSierpinski carpetsThurston equivalencedessins d'enfantHurwitz maps

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Schwarz-Christoffel-type mappings (30C30) Combinatorics and topology in relation with holomorphic dynamical systems (37F20)

Related Items (3)

Algorithmic aspects of branched coverings ⋮ Centralizers in mapping class groups and decidability of Thurston equivalence ⋮ Constructive geometrization of Thurston maps and decidability of Thurston equivalence

Uses Software

• GAP
• PARI/GP
• STRIPACK

Cites Work

• Realisierung von Gruppen \(PSL_ 2({\mathbb{F}}_ p)\) als Galoisgruppen über \({\mathbb{Q}}\)
• Polynomials for primitive nonsolvable permutation groups of degree d\(\leq 15\)
• Factoring polynomials with rational coefficients
• A proof of Thurston's topological characterization of rational functions
• Some coverings defined over \(\mathbb{Q}\)
• Delaunay refinement algorithms for triangular mesh generation
• The Medusa algorithm for polynomial matings
• Numerische Realisierung konformer Abbildungen durch „Interpolation”
• Critical portraits for postcritically finite polynomials
• Algorithm 772
• Uniformizing dessins and Belyĭ maps via circle packing
• Convergence of a Variant of the Zipper Algorithm for Conformal Mapping

This page was built for publication: Algorithmic Construction of Hurwitz Maps