Related papers: Frobenius lifts and point counting for smooth curv…
We present highlights of computations of the Riemann zeta function around large values and high zeros. The main new ingredient in these computations is an implementation of the second author's fast algorithm for numerically evaluating…
We describe an algorithm, based on the properties of the characteristic polynomials of Frobenius, to compute $\operatorname{End}_{\overline{K}}(A)$ when $A$ is the Jacobian of a nice genus-2 curve over a number field $K$. We use this…
We present an explicit and computationally actionable blueprint for constructing vector-valued Siegel modular forms associated to real multiplication (RM) abelian surfaces, leveraging the theta correspondence for the unitary dual pair…
Let E be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. The field of definition of E is the ring class field Omega of the order. If the prime p splits completely in Omega, then…
We review existing methods for implementing smooth functions f(A) of a sparse Hermitian matrix A on a quantum computer, and analyse a further combination of these techniques which has some advantages of simplicity and resource consumption…
The local zeta functions (also called Igusa's zeta functions) over p-adic fields are connected with the number of solutions of congruences and exponential sums mod p^{m}. These zeta functions are defined as integrals over open and compact…
Motivated by applications in point counting algorithms using p-adic cohomology, we give an explicit description of integral lattices in rigid cohomology spaces that p-adically approximate logarithmic crystalline cohomology modules. These…
The hemisphere soft function is calculated to order alpha_s^2. This is the first multi-scale soft function calculated to two loops. The renormalization scale dependence of the result agrees exactly with the prediction from effective field…
We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…
We generalize Elkies's method, an essential ingredient in the SEA algorithm to count points on elliptic curves over finite fields of large characteristic, to the setting of p.p. abelian surfaces. Under reasonable assumptions related to the…
In this note we investigate the connection between polylogarithms on curves and abelian schemes. The main result shows that the polylogarithm on the abelian scheme can be obtained as the push-forward of the polylogarithm on a suitable…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
Optimal-order uniform-in-time $H^1$-norm error estimates are given for semi- and full discretizations of mean curvature flow of surfaces in arbitrarily high codimension. The proposed and studied numerical method is based on a parabolic…
This paper examines the arithmetic of the loci \(\cL_n\), parameterizing genus 2 curves with \((n, n)\)-split Jacobians over finite fields \(\F_q\). We compute rational points \(|\cL_n(\F_q)|\) over \(\F_3\), \(\F_9\), \(\F_{27}\),…
I give a formula for the zeta function of a projective toric hypersurface over a finite field and estimate its Newton polygon. As an application this formula allows us to compute the exact number of rational points on the families of…
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…
In this article we give the details of an effective point counting algorithm for genus two curves over finite fields of characteristic three. The algorithm has an application in the context of curve based cryptography. One distinguished…
We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of…
We prove a large sieve statement for the average distribution of Frobenius conjugacy classes in arithmetic monodromy groups over finite fields. As a first application we prove a stronger version of a result of Chavdarov on the ``generic''…
It is a well known result that the number of points over a finite field on the Legendre family of elliptic curves can be written in terms of a hypergeometric function modulo $p$. In this paper, we extend this result, due to Igusa, to a…