Related papers: An algorithm for computing the Weierstrass normal …
We present a new algorithm for computing the endomorphism ring of an ordinary abelian surface over a finite field which is subexponential and generalizes an algorithm of Bisson and Sutherland for elliptic curves. The correctness of this…
Given a lattice $\Lambda \subset \mathbb C\simeq \mathbb R^2$ with associated Weierstrass function $\wp_{\Lambda}$, we determine the algebraic curves in $\mathbb R^2$ whose image via $\wp_{\Lambda}$ is contained in an algebraic curve.
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…
This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…
Using an explicit version of the Mumford isomorphism on the moduli space of hyperelliptic curves we derive a closed formula for the Arakelov-Green function of a hyperelliptic Riemann surface evaluated at its Weierstrass points.
We solve the problem of characteristic numbers of elliptic curves in any dimensional projective space The answers are given in the form of effective recursions. Many numerical examples are provided. A C++ program implementing all the…
The aim of this paper is to review the main techniques in the computation of Weierstra\ss semigroup at several points of curves defined over perfect fields, with special emphasis on the case of two points. Some hints about the usage of some…
Let $C$ be a hyperelliptic curve of genus $g\ge 2$ over a discrete valuation field $K$ with perfect residue field. We study the minimal Weierstrass models of $C$. When there is more than one such model, we find interesting properties on the…
In this paper, we first summarize the existing algorithms for computing all the generalized asymptotes of a plane algebraic curve implicitly or parametrically defined. From these previous results, we derive a method that allows to easily…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
For E/k an elliptic curve with CM by O, we determine a formula for (a generalization of) the arithmetic local constant of [4] at almost all primes of good reduction. We apply this formula to the CM curves defined over Q and are able to…
This paper proposes an algorithm for oblivious transfer using elliptic curves. Also, we present its application to chosen one-out-of-two oblivious transfer.
For a superelliptic curve $\mathcal X$, defined over $\mathbb Q$, let $\mathfrak p$ denote the corresponding moduli point in the weighted moduli space. We describe a method how to determine a minimal integral model of $\mathcal X$ such…
We study families of superelliptic curves with fixed automorphism groups. Such families are parametrized with invariants expressed in terms of the coefficients of the curves. Algebraic relations among such invariants determine the lattice…
The $\varepsilon$-form of a system of differential equations for Feynman integrals has led to tremendeous progress in our abilities to compute Feynman integrals, as long as they fall into the class of multiple polylogarithms. It is…
Let $E:y^2=x^3+ax+b$ be an elliptic curve defined over $\mathbb{Q}$. We compute certain twists of the classical modular curves $X(8)$. Searching for rational points on these twists enables us to find non-trivial pairs of $8$-congruent…
We construct genus one curves on base extensions of generic Severi--Brauer varieties of a given index and period which are versal objects for families of geometrically elliptic normal curves. We also compute the periods and indices of these…
Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is…
Let $[K:\mathbb{Q}]=p$ be a prime number and let $E/K$ be an elliptic curve with $j(E) \in \mathbb{Q}$. We determine the all possibilities for $E(K)_{tors}$. We obtain these results by studying Galois representations of $E$ and of it's…
Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.