Related papers: Computing Euclidean Belyi maps
We present robust algorithms for set operations and Euclidean transformations of curved shapes in the plane using approximate geometric primitives. We use a refinement algorithm to ensure consistency. Its computational complexity is…
We present a complex matrix gauge model defined on an arbitrary two-dimensional orientable lattice. We rewrite the model's partition function in terms of a sum over representations of the group U(N). The model solves the general…
We prove that the set of non-degenerate second order maximally superintegrable systems in the complex Euclidean plane carries a natural structure of a projective variety, equipped with a linear isometry group action. This is done by…
Cooper and Long generalised Epstein and Penner's Euclidean cell decomposition of cusped hyperbolic manifolds of finite volume to non-compact strictly convex projective manifolds of finite volume. We show that Weeks' algorithm to compute…
We study plane algebraic curves defined over a field k of arbitrary characteristic as coverings of the the projective line and the problem of enumerating branched coverings of $\mathbb{P}^{1}$ by using combinatorial methods.
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
A result of Belyi can be stated as follows. Every curve defined over a number field can be expressed as a cover of the projective line with branch locus contained in a rigid divisor. We define the notion of geometrically rigid divisors in…
The group of units modulo constants of an affine variety over an algebraically closed field is free abelian of finite rank. Computing this group is difficult but of fundamental importance in tropical geometry, where it is desirable to…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
An abundance of real-world problems manifest as covering edges and/or vertices of a graph with cliques that are optimized for some objectives. We consider different structural parameters of graph, and design fixed-parameter tractable…
In classical differential geometry, a central question has been whether abstract surfaces with given geometric features can be realized as surfaces in Euclidean space. Inspired by the rich theory of embedded triply periodic minimal…
We provide an elementary proof of a simple, efficient algorithm for computing the Euclidean projection of a point onto the probability simplex. We also show an application in Laplacian K-modes clustering.
We compute the Betti numbers and describe the cohomology algebras of the ordered and unordered configuration spaces of three points in complex projective spaces, including the infinite dimensional case. We also compute these invariants for…
In this paper we survey Eckardt points on a smooth complex cubic threefold with an approach aimed at computing all Eckardt points of a cubic threefold. In addition, we construct cubic threefolds with no Eckardt points but containing triple…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
We solve some computational problems for triangulated closed three-dimensional manifolds using groups of simplicial homology and cohomology modulo 2. Two efficient algorithms for computing the intersection numbers of 1- and 2-dimensional…
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 study of the moduli of covers of the projective line leads to the theory of Hurwitz varieties covering configuration varieties. Certain one-dimensional slices of these coverings are particularly interesting Belyi maps. We present…
We show that the image of the pure braid group under the monodromy action on the homology of a cyclic covering of degree d of the projective line is an arithmetic group provided the number of branch points is sufficiently large compared to…