Related papers: On computing Belyi maps
We present an approach to a large class of enumerative problems concerning rational curves in projective spaces. This approach uses analysis to obtain topological information about moduli spaces of stable maps. We demonstrate it by…
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
We propose an approach for the computation of multi-parameter families of Galois extensions with prescribed ramification type. More precisely, we combine existing deformation and interpolation techniques with recently developed strong tools…
Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…
We prove an analog of Belyi's theorem for the algebraic surfaces. Namely, any non-singular algebraic surface can be defined over a number field if and only it covers the complex projective plane with ramification at three knotted…
A tool package for computing genus 0 Belyi functions is presented, including simplification routines, computation of moduli fields, decompositions, dessins d'enfant. The main algorithm for computing the Belyi functions themselves is based…
We propose a novel way of computing surface folding maps via solving a linear PDE. This framework is a generalization to the existing quasiconformal methods and allows manipulation of the geometry of folding. Moreover, the crucial quantity…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
We provide an end-to-end workflow to rigorously compute the monodromy of Belyi maps from exact equations over number fields using certified homotopy continuation. We then apply this method at scale to certify the monodromy triples of Belyi…
Given a finite index subgroup $\Gamma$ of ${\rm{PSL}}_2(\Bbb{Z})$, we investigate Belyi functions on the corresponding modular curve $X(\Gamma)$ by introducing two methods for constructing such functions. Numerous examples have been worked…
Exact bounds for the positions of the branch points for cyclic coverings of the $p$-adic projective line by Mumford curves are calculated in two ways. Firstly, by using Fumiharu Kato's *-trees, and secondly by giving explicit matrix…
The theory of poles of solutions of Painleve-I is equivalent to the Nevanlinna problem of constructing a meromorphic function ramified over five points - counting multiplicities - and without critical points. We construct such meromorphic…
This paper is devoted to the investigation of selected situations when the computation of projective (and other) equivalences of algebraic varieties can be efficiently solved with the help of finding projective equivalences of finite sets…
Exceptional Belyi covering is a connected Belyi covering uniquely determined by its ramification scheme or the respective dessin d'enfant. We focus on rational exceptional Belyi coverings of compact Riemann surfaces of genus 0. Well known…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…
We study the theoretical and practical aspects of computing braids described by approximate descriptions of paths in the plane. Exact algorithms rely on the lexicographic ordering of the points in the plane, which is unstable under…
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…
We review the Shimura-Taniyama method for computing the Newton polygon of an abelian variety with complex multiplication. We apply this method to cyclic covers of the projective line branched at three points. As an application, we produce…