Related papers: The Belyi degree is computable
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
The information complexity of a function $f$ is the minimum amount of information Alice and Bob need to exchange to compute the function $f$. In this paper we provide an algorithm for approximating the information complexity of an arbitrary…
In this note we investigate the connection between polylogarithms on curves and abelian schemes. The main result shows that the polylogarithm on the abelian scheme can be obtained as the push-forward of the polylogarithm on a suitable…
Given a smooth complex variety $X$, an algebraically skew embedding of $X$ is an embedding of $X$ into a complex projective space $\mathbb{P}^N$ such that for any two points $x,y\in X$, their embedded tangent spaces in $\mathbb{P}^N$ do not…
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…
We give an efficient algorithm to compute equations of twists of hyperelliptic curves of arbitrary genus over any separable field (of characteristic different from 2), and we explicitly describe some interesting examples.
We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. We give a general bound on their minimum distance and we investigate how this estimation can be sharpened under the…
We study the Calabi functional on a ruled surface over a genus two curve. For polarisations which do not admit an extremal metric we describe the behaviour of a minimising sequence splitting the manifold into pieces. We also show that the…
Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise Linear Structure (PLS) isotopic to the original space curve.…
The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…
Let $C$ be a nodal curve and $L$ be an invertible sheaf on $C$. Let $\alpha_{L}:C\dashrightarrow J_{C}$ be the degree-$1$ rational Abel map, which takes a smooth point $Q\in C$ to $\left[ m_{Q}\otimes L\right] $ in the Jacobian of $C$. In…
In this paper we study the degrees of irrationality of hypersurfaces of large degree in a complex projective variety. We show that the maps computing the degrees of irrationality of these hypersurfaces factor through rational fibrations of…
Motivated by applications to topological data analysis, we give an efficient algorithm for computing a (minimal) presentation of a bigraded $K[x,y]$-module $M$, where $K$ is a field. The algorithm takes as input a short chain complex of…
In this paper, we present a probabilistic algorithm to compute the number of $\mathbb{F}_p$-points of modular curve $X_1(n)$. Under the Generalized Riemann Hypothesis(GRH), the algorithm takes…
We give a formula to compute all the top degree graded Betti numbers of the path ideal of a cycle. Also we will find a criterion to determine when Betti numbers of this ideal are non zero and give a formula to compute its projective…
We characterize the curves in $ P^3$ which are minimal in their biliaison class. Such curves are exactly the curves which do no admit an elementary descending biliaison. As a consequence we have that every curve in $P^3$ can be obtained…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
In this paper, we give an efficient algorithm of degree reduction of B\'ezier curves with box constraints. The idea is to combine the previous iterative approach, that has been presented recently in (P. Gospodarczyk, Comput. Aided Des. 62…
We propose a novel way of computing surface folding maps via solving a linear PDE. This framework is a generalization to the existing quasiconformal methods and allows manipulation of the geometry of folding. Moreover, the crucial quantity…