Related papers: Efficient Point-Counting Algorithms for Superellip…

We describe an algorithm that provably computes the rational torsion subgroup of the Jacobian of a curve without relying on height bounds. Instead, the strategy is to find upper bounds for the torsion subgroup using reduction modulo primes,…

A superspecial curve is a (non-singular) curve over a field of positive characteristic whose Jacobian variety is isomorphic to a product of supersingular elliptic curves over the algebraic closure. It is known that for given genus and…

Point containment queries on trimmed surfaces are fundamental to CAD modeling, solid geometry processing, and surface tessellation. Existing approaches such as ray casting and generalized winding numbers often face limitations in robustness…

The main goal of the paper is to introduce methods which compute B\'ezier curves faster than Casteljau's method does. These methods are based on the spectral factorization of a $n\times n$ Bernstein matrix, $B^e_n(s)= P_nG_n(s)P_n^{-1}$,…

Let a polytope $P$ be defined by a system $A x \leq b$. We consider the problem of counting the number of integer points inside $P$, assuming that $P$ is $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank…

We give explicit formulas for the number of distinct elliptic curves over a finite field, up to isomorphism, in the families of Legendre, Jacobi, Hessian and generalized Hessian curves.

We consider elliptic curves defined by an equation of the form $y^2=x^3+f(t)$, where $f\in k[t]$ has coefficients in a perfect field $k$ of characteristic not $2$ or $3$. By performing $2$ and $3$-descent, we obtain, under suitable…

For an elliptic curve $E$ over a finite field $\F_q$, where $q$ is a prime power, we propose new algorithms for testing the supersingularity of $E$. Our algorithms are based on the Polynomial Identity Testing (PIT) problem for the $p$-th…

For the hyperelliptic curve C_p with equation y^2=x(x-2p)(x-p)(x+p)(x+2p) with p a prime number, we discuss bounds for the rank of its Jacobian over Q, find many cases having 2-torsion in the associated Shafarevich-Tate group, and we…

Let C be an arbitrary smooth algebraic curve of genus g over a large finite field K. We revisit fast addition algorithms in the Jacobian of C due to Khuri-Makdisi (math.NT/0409209, to appear in Math. Comp.). The algorithms, which reduce to…

In 1922, Mordell conjectured that the set of rational points on a smooth curve $C$ over $\mathbb{Q}$ with genus $g \ge 2$ is finite. This has been proved by Faltings in 1983. However, Coleman determined in 1985 an upper bound of…

This paper proposes new explicit formulas for the doubling and addition step in Miller's algorithm to compute the Tate pairing. For Edwards curves the formulas come from a new way of seeing the arithmetic. We state the first geometric…

We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…

An algorithm is given to compute a normal form for hyperelliptic curves. The elliptic case has been treated in a previous paper. In this paper the hyperelliptic case is treated.

In this work we propose an algorithm that numerically evaluates Kleinian hyperelliptic functions associated with a complex curve of genus 2. This algorithm is based upon constructing a sequence of curves with Richelot isogenous Jacobians…

We explain a method for computing the Cassels-Tate pairing on the 3-isogeny Selmer groups of an elliptic curve. This improves the upper bound on the rank of the elliptic curve coming from a descent by 3-isogeny, to that coming from a full…

The Perspective-Three-Point Problem (P3P) is solved by first focusing on determining the directions of the lines through pairs of control points, relative to the camera, rather than the distances from the camera to the control points. The…

Coleman's theory of p-adic integration figures prominently in several number-theoretic applications, such as finding torsion and rational points on curves, and computing p-adic regulators in K-theory (including p-adic heights on elliptic…

This note explains how to obtain, install, and use the ratpoints program. The program finds rational points up to a specified height on hyperelliptic curves using a highly optimized quadratic sieving algorithm.

The corresponding Hasse-Weil bound was a major breakthrough in history of mathematics. It has found many applications in mathematics, coding theory and theoretical computer science. In general, the Hasse-Weil bound is tight and cannot be…