Related papers: Computing Euclidean Belyi maps

We classify trivalent graphs with 16 vertices and 16 edges that arise from intersecting two quadratic surfaces in tropical 3-space. There are 4,009 such graphs, representing maximally degenerate stable models of elliptic curves realized as…

We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that separates the vertices into two types: ``rigid'' (such that the…

This paper studies binary quadratic programs in which the objective is defined by a Euclidean distance matrix, subject to a general polyhedral constraint set. This class of nonconcave maximisation problems includes the capacitated,…

We use basic algebraic topology and Ellingsrud-Stromme results on the Betti numbers of punctual Hilbert schemes of surfaces to compute a generating function for the Euler characteristic numbers of the Douady spaces of "n-points" associated…

In this article we complete the work of enumerating typical abelian coverings of Cayley graphs, by reducing the problem to enumerating certain subgroups of finite abelian groups.

We develop an algorithm computing the transcendental lattice and the Mordell--Weil group of an extremal elliptic surface. As an example, we compute the lattices of four exponentially large series of surfaces

Constructive-deductive method for plane Euclidean geometry is proposed and formalized within Coq Proof Assistant. This method includes both postulates that describe elementary constructions by idealized geometric tools (pencil, straightedge…

An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called ``ice-type…

Consider a smooth complex surface $X$ which is a double cover of the projective plane $\mathbb{P}^2$ branched along a smooth curve of degree $2s$. In this article, we study the geometric conditions which are equivalent to the existence of…

We introduce Eulerian maps with blocked edges as a general way to implement statistical matter models on random maps by a modification of intrinsic distances. We show how to code these dressed maps by means of mobiles, i.e. decorated trees…

We present an algorithm that computes the multipole coefficients of the galaxy three-point correlation function (3PCF) without explicitly considering triplets of galaxies. Rather, centering on each galaxy in the survey, it expands the…

The distributional analysis of Euclidean algorithms was carried out by Baladi and Vall\'{e}e. They showed the asymptotic normality of the number of division steps and associated costs in the Euclidean algorithm as a random variable on the…

We compute the integral Picard group of the moduli stack of polarized K3 surfaces of fixed degree whose singularities are at most rational double points. We also compute the integral Picard group of the stack of quasi-polarized K3 surfaces,…

We study the topological complexity, in the sense of Smale, of three enumerative problems in algebraic geometry: finding the 27 lines on cubic surfaces, the 28 bitangents and the 24 inflection points on quartic curves. In particular, we…

We prove that a Cayley graph can be embedded in the euclidean plane without accumulation points of vertices if and only if it is the 1-skeleton of a Cayley complex that can be embedded in the plane after removing redundant simplices. We…

There are only 10 Euclidean forms, that is flat closed three dimensional manifolds: six are orientable $\mathcal{G}_1,\dots,\mathcal{G}_6$ and four are non-orientable $\mathcal{B}_1,\dots,\mathcal{B}_4$. The aim of this paper is to describe…

Let $k$ be either a number a field or a function field over $\mathbb{Q}$ with finitely many variables. We present a practical algorithm to compute the geometric Picard lattice of a K3 surface over $k$ of degree $2$, i.e., a double cover of…

Let X be the blow-up of the three dimensional complex projective space along r general points of a smooth elliptic quartic curve B of P^3 and let L be any line bundle of X. The aim of this paper is to provide an explicit algorithm for…

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…

We consider the general problem of enumerating branched covers of the projective line from a fixed general curve subject to ramification conditions at possibly moving points. Our main computations are in genus 1; the theory of limit linear…