Related papers: Improved Complexity Bounds for Counting Points on …
In this work, we investigate hyperelliptic curves of type $C: y^2 = x^{2g+1} + ax^{g+1} + bx$ over the finite field $\mathbb{F}_q, q = p^n, p > 2$. For the case of $g = 3$ and $4$ we propose algorithms to compute the number of points on the…
Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…
The currently best known algorithms for the numerical evaluation of hypergeometric constants such as $\zeta(3)$ to $d$ decimal digits have time complexity $O(M(d) \log^2 d)$ and space complexity of $O(d \log d)$ or $O(d)$. Following work…
In this paper we present a new approach to counting the proportion of hyperelliptic curves of genus $g$ defined over a finite field $\mathbb{F}_q$ with a given $a$-number. In characteristic three this method gives exact probabilities for…
In this paper, an algorithm to compute a certified $G^1$ rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the…
We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree…
For an elliptic curve with CM by $K$ defined over its Hilbert class field, $E/H$, we extend Lenstra's finite fields test to generators of norms of certain ideals in $\mathcal{O}_H$, yielding a sufficient $\widetilde{O}(\log^3 N)$ primality…
We present an index calculus algorithm with double large prime variation which lends itself well to a rigorous analysis. Using this algorithm we prove that for fixed genus $g \geq 2$, the discrete logarithm problem in degree 0 class groups…
Quadratic Chabauty is a $p$-adic method for determining rational points on curves. Local heights are arithmetic invariants used in the quadratic Chabauty method. We present an algorithm to compute these local heights for hyperelliptic…
A new method is devised for calculating the Igusa local zeta function $Z_f$ of a polynomial $f(x_1,\dots,x_n)$ over a $p$-adic field. This involves a new kind of generating function $G_f$ that is the projective limit of a family of…
In the model of \emph{local computation algorithms} (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve time and space…
Let E be an elliptic curve without complex multiplication (CM) over a number field K, and let G_E(ell) be the image of the Galois representation induced by the action of the absolute Galois group of K on the ell-torsion subgroup of E. We…
By a hyperelliptic curve over Q, we mean a smooth, geometrically irreducible, complete curve C over Q equipped with a fixed map of degree 2 to P^1 defined over Q. Thus any hyperelliptic curve C over Q of genus g can be embedded in weighted…
Under the assumption of a certain conjecture, for which there exists strong experimental evidence, we produce an efficient algorithm for constructive membership testing in the Suzuki groups Sz(q), where q = 2^{2m + 1} for some m > 0, in…
We study theta characteristics of hyperelliptic metric graphs of genus $g$ with no bridge edges. These graphs have a harmonic morphism of degree two to a metric tree that can be lifted to morphism of degree two of a hyperelliptic curve $X$…
We describe an algorithm to compute the zeta-function of a proper, smooth curve over a finite field, when the curve is given together with some auxiliary data. Our method is based on computing the matrix of the action of a semi-linear…
In this paper we describe a generalisation and adaptation of Kedlaya's algorithm for computing the zeta function of a hyperelliptic curve over a finite field of odd characteristic that the author used for the implementation of the algorithm…
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…
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…
We study the computational power of randomized computations on infinite objects, such as real numbers. In particular, we introduce the concept of a Las Vegas computable multi-valued function, which is a function that can be computed on a…