Related papers: The Belyi degree is computable

The parametric degree of a rational surface is the degree of the polynomials in the smallest possible proper parametrization. An example shows that the parametric degree is not a geometric but an arithmetic concept, in the sense that it…

We compute the genus 0 Belyi map for the sporadic Janko group J1 of degree 266 and describe the applied method. This yields explicit polynomials having J1 as a Galois group over K(t), [K:Q] = 7.

We first show a simple but striking result in bilevel optimization: unconstrained $C^\infty$ smooth bilevel programming is as hard as general extended-real-valued lower semicontinuous minimization. We then proceed to a worst-case analysis…

The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…

Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…

We identify a common scheme in several existing algorithms addressing computational problems on linear differential equations with polynomial coefficients. These algorithms reduce to computing a linear relation between vectors obtained as…

In this note we consider questions about parametrisations of elliptic curves defined over number fields by quotients of the upper half-plane by finite index subgroups of SL_2(Z). We ask if we can choose such a parametrisation of an elliptic…

Consider an ideal $I\subset K[x_1,..., x_n]$, with $K$ an arbitrary field, generated by monomials of degree two. Assuming that $I$ does not have a linear resolution, we determine the step $s$ of the minimal graded free resolution of $I$…

We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…

We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…

We introduce the concept of the modularity of an abelian variety defined over the rational number field extending the modularity of an elliptic curve. We discuss the modularity of an abelian variety over the rational number field. We…

In this paper, a de Casteljau algorithm to compute (p,q)-Bernstein Bezier curves based on (p,q)-integers is introduced. We study the nature of degree elevation and degree reduction for (p,q)-Bezier Bernstein functions. The new curves have…

Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…

Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…

For any finite Blaschke product $B$, there is an injective analytic map $\varphi:\mathbb{D}\to\mathbb{C}$ and a polynomial $p$ of the same degree as $B$ such that $B=p\circ\varphi$ on $\mathbb{D}$. Several proofs of this result have been…

In this paper, the problem of bounding the number of reducible curves in a pencil of algebraic plane curves is addressed. Unlike most of the previous related works, each reducible curve of the pencil is here counted with its appropriate…

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

We study a class of graphs with finitely many edges in order to understand the nature of the formal logarithm of the generating series for Severi degrees in elementary combinatorial terms. These graphs are related to floor diagrams…

It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field.

We classify, up to equivalence, all finite-dimensional simple graded division algebras over the field of real numbers. The grading group is any finite abelian group.