Related papers: Computing Euclidean Belyi maps
We compute the weighted Euler characteristic, equivariant with respect to the action of the symplectic group of degree six over the field of two elements, of the moduli space of principally polarized abelian threefolds together with a level…
We present new iterative algorithms for solving a square linear system $Ax=b$ in dimension $n$ by employing the {\it Triangle Algorithm} \cite{kal12}, a fully polynomial-time approximation scheme for testing if the convex hull of a finite…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
We develop a new method for the computation of $(3,3)$-isogenies between principally polarized abelian surfaces. The idea is to work with models in $\mathbb{P}^8$ induced by a symmetric level-$3$ theta structure. In this setting, the action…
We present closed form expressions for the ranks of all cohomology groups of holomorphic line bundles on several Calabi-Yau threefolds realised as complete intersections in products of projective spaces. The formulae have been obtained by…
We compute the image of any choice of complex conjugation on the Galois representations associated to regular algebraic cuspidal automorphic representations and to torsion classes in the cohomology of locally symmetric spaces for $GL_n$…
Given a connected smooth projective surface X over the complex numbers, together with a simple normal crossings divisor D on it, we study finite normal covers Y of X that are unramified outside D. Given moreover a fibration of X onto a…
We calculate a semi-orthogonal decomposition of the bounded derived category of coherent sheaves on P(1,1,1,3) using a tilting bundle.
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…
A branched covering map of surfaces induces a map in the opposite direction between their arc complexes. We represent a branched covering map combinatorially using what we call a lifting picture, and use this representation to computably…
We study the reflectional symmetry of a surface in the Euclidean 3-dimensional space with a cross-cap singularity with respect to planes. This symmetry is picked up by the singularities of folding maps on the cross-cap. We give a list of…
In this paper we construct a new class of algebraic surfaces in three-dimensional Euclidean space generated by a cyclic-harmonic curve and a congruence of circles. We study their properties and visualize them with the program Mathematica.
We introduce an approach based on moving frames for polygon recognition and symmetry detection. We present detailed algorithms for recognition of polygons modulo the special Euclidean, Euclidean, equi-affine, skewed-affine and similarity…
We classify projective plane nonsingular curves admitting a 3-term presentation; they exist in any degree, generally constitute 5 birational families and are defined over rational numbers. The Belyi functions on all these curves are…
We study a class of algebraic surfaces of degree 3n in the complex projective space with only ordinary double points. They are obtained by using bivariate polynomials with complex coefficients related to the generalized cosine associated to…
We present an algorithm for producing Delaunay triangulations of manifolds. The algorithm can accommodate abstract manifolds that are not presented as submanifolds of Euclidean space. Given a set of sample points and an atlas on a compact…
In this paper, we study the Newton polygons and Ekedahl-Oort types of reductions of abelian covers of the projective line branched at three points modulo a prime. We study the natural density of primes where these covers give supersingular…
In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one…
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic methods.
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…