Related papers: Point counting in families of hyperelliptic curves…

Let $\L_g^G$ denote the locus of hyperelliptic curves of genus $g$ whose automorphism group contains a subgroup isomorphic to $G$. We study spaces $\L_g^G$ for $G \iso \Z_n, \Z_2{\o}\Z_n, \Z_2{\o}A_4$, or $SL_2(3)$. We show that for $G \iso…

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…

The generating function for $S_n$-equivariant Euler characteristics of moduli spaces of pointed hyperelliptic curves for any genus g>1 is calculated. This answer generalizes the known ones for genera 2 and 3 and answers obtained by J.…

Given an elliptic curve E over a field of positive characteristic p, we consider how to efficiently determine whether E is ordinary or supersingular. We analyze the complexity of several existing algorithms and then present a new approach…

We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An…

We describe an algorithm to compute the number of points over finite fields on a broad class of modular curves: we consider quotients $X_H/W$ for $H$ a subgroup of $\GL_2(\mathbb Z/n\mathbb Z)$ such that for each prime $p$ dividing $n$, the…

The van der Geer--van der Vlugt curves form a class of Artin--Schreier coverings of the projective line over finite fields. We provide an explicit formula for their $L$-polynomials in characteristic $2$, expressed in terms of characters of…

In this paper, we are going to compute the average size of 2-Selmer groups of families of even hyperelliptic curves over function fields. The result will be obtained by a geometric method which is based on a Vinberg representation of the…

We construct families of hyperelliptic curves over Q of arbitrary genus g with (at least) g integral elements in K_2. We also verify the Beilinson conjectures about K_2 numerically for several curves with g=2, 3, 4 and 5. The paper is…

We study the minimal Weierstrass equations for genus 2 curves defined over a ring of integers $\mathcal O_{\mathbb F}$. This is done via reduction theory and Julia invariant of binary sextics. We show that when the binary sextics has extra…

We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite…

The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by [Thomassen '89 & '93], and it is known to be fixed-parameter tractable. However, the…

We present the first sub-quadratic time algorithm that with high probability correctly reconstructs phylogenetic trees for short sequences generated by a Markov model of evolution. Due to rapid expansion in sequence databases, such very…

We give two new approximation algorithms to compute the fractional hypertree width of an input hypergraph. The first algorithm takes as input $n$-vertex $m$-edge hypergraph $H$ of fractional hypertree width at most $\omega$, runs in…

We extend to the function field setting the heuristic previously developed, by Conrey, Farmer, Keating, Rubinstein and Snaith, for the integral moments and ratios of $L$-functions defined over number fields. Specifically, we give a…

Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…

In 2005, Kayal suggested that Schoof's algorithm for counting points on elliptic curves over finite fields might yield an approach to factor polynomials over finite fields in deterministic polynomial time. We present an exposition of his…

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…

Let $E$ be an elliptic curve defined over a field $K$ (with $char(K)\neq 2$) given by a Weierstrass equation and let $P=(x,y)\in E(K)$ be a point. Then for each $n$ $\geq 1$ and some $\gamma \in K^{\ast }$ we can write the $x$- and…

We present efficient algorithms for counting points on a smooth plane quartic curve $X$ modulo a prime $p$. We address both the case where $X$ is defined over $\mathbb F_p$ and the case where $X$ is defined over $\mathbb Q$ and $p$ is a…