Related papers: Point counting in families of hyperelliptic curves…

In our previous work, we gave a formula for the Frobenius eigenvalues of van der Geer--van der Vlugt curves in characteristic 2 by considering suitable quotients of the curve. Although the formula is explicit, it depends on many choices,…

We explain how we computed equations for all genus 4 curves defined of the field with 2 elements, up-to-isomorphism, and some of the data we obtained. We give descriptions also of nice models for genus 4 curves over characteristic 2 fields,…

Let $C$ be a smooth plane quartic curve over $\mathbb{Q}$. Costa, Harvey and Sutherland provide an algorithm with an implementation, improving Harvey's average polynomial-time algorithm, to compute the $\bmod \ p$ reduction of the numerator…

Classical hypergeometric functions are well-known to play an important role in arithmetic algebraic geometry. These functions offer solutions to ordinary differential equations, and special cases of such solutions are periods of…

We present a new approach to handling the case of Atkin primes in Schoof's algorithm for counting points on elliptic curves over finite fields. Our approach is based on the theory of polynomially cyclic algebras, which we recall as far as…

We construct families of smooth, proper, algebraic curves in characteristic 0, of arbitrary genus g, together with g elements in the kernel of the tame symbol. We show that those elements are in general independent by a limit calculation of…

Consider two elliptic curves $E,E'$ defined over the finite field $\mathbb{F}_q$, and suppose that there exists an isogeny $\psi$ between $E$ and $E'$. We propose an algorithm that determines $\psi$ from the knowledge of $E$, $E'$ and of…

We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized…

In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$, $g \in \mathbb{Z}[x,y]$ and an arbitrary polynomial $h \in…

We compute in a direct (not algorithmic) way the zeta function of all supersingular curves of genus 2 over a finite field k, with many geometric automorphisms. We display these computations in an appendix where we select a family of…

We present a new method for computing the zeta function of an algebraic curve over a finite field. The algorithm relies on a trace formula of Harvey to count points on a plane model of the curve. The zeta function of the curve is then…

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for…

Based on the theory of rigid cohomology, we provide an explicit formula of zeta functions of certain K3 families, which we call the hypergeometric type. The central point of our argument is the comparison between the 2nd rigid cohomology of…

Let alpha be an automorphism of a hyperelliptic curve C of genus g, and let alpha' be the automorphism of P^1 induced by alpha. Let n be the order of alpha and let n' be the order of alpha'. We show that the triple (g,n,n') completely…

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.

We stratify families of projective and very affine hypersurfaces according to their topological Euler characteristic. Our new algorithms compute all strata using algebro-geometric techniques. For very affine hypersurfaces, we investigate…

We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…

We introduce a new collection of special functions associated to a complex curve of genus 2 similar to Kleinian hyperelliptic $\sigma$-function. These functions are related to weight 2 $\theta$-functions in the same fashion as…

We propose an algorithm that calculates isogenies between elliptic curves defined over an extension $K$ of $\mathbb{Q}_2$. It consists in efficiently solving with a logarithmic loss of $2$-adic precision the first order differential…