Related papers: Computing Euclidean Belyi maps
We compute the canonical model of the cover of Shimura curves $X_0(2) \to X(1)$ for the cubic field of discriminant 13^2 described at the end of Elkies' paper "Shimura curves for level 3 subgroups of the (2,3,7) triangle group". Last, we…
We construct immersions of trivalent abstract tropical curves in the Euclidean plane and embeddings of all abstract tropical curves in higher dimensional Euclidean space. Since not all curves have an embedding in the plane, we define the…
This work addresses the problem of simulating Gaussian random fields that are continuously indexed over a class of metric graphs, termed graphs with Euclidean edges, being more general and flexible than linear networks. We introduce three…
To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. It was shown earlier that the splice diagram determines the universal abelian cover of the manifold. We will in this article…
We compute the stable reduction of some Galois covers of the projective line branched at three points. These covers are constructed using Hurwitz spaces parameterizing metacyclic covers. The reduction is determined by a hypergeometric…
In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…
In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…
We describe an algorithm to construct an intrinsic Delaunay triangulation of a smooth closed submanifold of Euclidean space. Using results established in a companion paper on the stability of Delaunay triangulations on $\delta$-generic…
We develop a new method to construct explicit, regular minimal surfaces in Euclidean space that are defined on the entire complex plane with controlled geometry. More precisely we show that for a large class of planar curves $(x(t), y(t))$…
In this paper we give an algorithm to find the 3-torsion subgroup of the Jacobian of a smooth plane quartic curve with a marked rational point. We describe $3-$torsion points in terms of cubics which triply intersect the curve, and use this…
Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…
We consider normal covers of CP^1 with abelian deck group, branched over at most four points. Families of such covers yield arithmetic Teichm\"uller curves, whose period mapping may be described geometrically in terms of Schwarz triangle…
We propose a linear time and constant space algorithm for computing Euclidean projections onto sets on which a normalized sparseness measure attains a constant value. These non-convex target sets can be characterized as intersections of a…
We give an algorithm for a surgery description of a $p$-fold cyclic branched cover of $B^3$ branched along a tangle. We generalize constructions of Montesinos and Akbulut-Kirby.
In this paper we demonstrate how the geometrically motivated algorithm to determine whether a two generator real Mobius group acting on the Poincare plane is or is not discrete can be interpreted as a non-Euclidean Euclidean algorithm. That…
Inspired by the concept of evolutoids of planar curves, we present the concept of evolutoids for regular surfaces as an envelope of a two-parameter family of lines in Euclidean 3-space. We give an explicit parametrization for such…
Given a set of $n$ points in the plane, the Unit Disk Cover (UDC) problem asks to compute the minimum number of unit disks required to cover the points, along with a placement of the disks. The problem is NP-hard and several approximation…
An unsupervised, iterative point-set registration algorithm for an unlabeled (i.e. correspondence between points is unknown) N-dimensional Euclidean point-cloud is proposed. It is based on linear least squares, and considers all possible…
In this paper we propose a heuristic technique for distributing points on the surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so called cyclic group codes.…
A cyclic cover of the complex projective line branched at four appropriate points has a natural structure of a square-tiled surface. We describe the combinatorics of such a square-tiled surface, the geometry of the corresponding…