Related papers: On computing Belyi maps
This paper is an elementary introduction to the theory of moduli spaces of curves and maps. As an application to enumerative geometry, we show how to count the number of bitangent lines to a projective plane curve of degree $d$ by doing…
Tropical geometry is a piecewise linear "shadow" of algebraic geometry. It allows for the computation of several cohomological invariants of an algebraic variety. In particular, its application to enumerative algebraic geometry led to…
In this note we compute some enumerative invariants of real and complex projective spaces by means of some enriched graphs called floor diagrams.
We introduce frameworks for constructing global derived moduli stacks associated to a broad range of problems, bridging the gap between the concrete and abstract conceptions of derived moduli. Our three approaches are via differential…
We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…
We give a Belyi-type characterisation of smooth complete intersections of general type over $\mathbb{C}$ which can be defined over $\bar{\mathbb{Q}}$. Our proof uses the higher-dimensional analogue of the Shafarevich boundedness conjecture…
This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces…
We examine a family of 3-point mappings that include mappings solvable through linearization. The different origins of mappings of this type are examined: projective equations and Gambier systems. The integrable cases are obtained through…
We use purely combinatorial arguments to give a formula to compute all graded Betti numbers of path ideals of line graphs and cycles. As a consequence we can give new and short proofs for the known formulas of regularity and projective…
Numerical tools for computation of $\wp$-functions, also known as Kleinian, or multiply periodic, are proposed. In this connection, computation of periods of the both first and second kinds is reconsidered. An analytical approach to…
We use the determinant method of Bombieri-Pila and Heath-Brown and its Arakelov reformulation by Chen utilizing Bost's slope method to estimate the number of hypersurfaces required to cover the regular rational points with bounded Arakelov…
In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…
In this note we discuss some arithmetic and geometric questions concerning self maps of projective algebraic varieties.
Let $\mathbb F_{q^2}$ be the finite field with $q^2$ elements. We provide a simple and effective method, using reciprocal polynomials, for the construction of algebraic curves over $\mathbb F_{q^2}$ with many rational points. The curves…
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…
The aim of this paper is to establish necessary and sufficient algorithmic conditions to guarantee that an algebra is actually a 3-dimensional skew polynomial algebra in the sense of Bell and Smith.
We consider triangulations of surfaces with edges painted three colors so that edges of each triangle have different colors. Such structures arise as Belyi data (or Grothendieck dessins d'enfant), on the other hand they enumerate pairs of…
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…
The main goal of this paper is to give a general method to compute (via computer algebra systems) an explicit set of generators of the ideals of the projective embeddings of some ruled surfaces, namely projective line bundles over curves…
We introduce a method-of-lines formulation of the closest point method, a numerical technique for solving partial differential equations (PDEs) defined on surfaces. This is an embedding method, which uses an implicit representation of the…