Related papers: Hypergeometric L-functions in average polynomial t…

For a fixed positive integer $e$, we describe an algorithm for computing, for all primes $p \leq X$, the mod-$p^e$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive over $\mathbb{Q}$ in time quasilinear in $X$.…

We define a function in terms of quotients of the $p$-adic gamma function which generalizes earlier work of the author on extending hypergeometric functions over finite fields to the $p$-adic setting. We prove, for primes $p > 3$, that the…

We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $\mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a…

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…

We discuss algorithms for arithmetic properties of hypergeometric functions. Most notably, we are able to compute the p-adic valuation of a hypergeometric function on any disk of radius smaller than the p-adic radius of convergence. This we…

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…

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…

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

The method of Frobenius is a standard technique to construct series solutions of an ordinary linear differential equation around a regular singular point. In the classical case, when the roots of the indicial polynomial are separated by an…

We present an algorithm that computes the Hasse-Witt matrix of given hyperelliptic curve over Q at all primes of good reduction up to a given bound N. It is simpler and faster than the previous algorithm developed by the authors.

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…

Let $A$ be an abelian variety over $\mathbb{Q}$ of dimension $g$ such that the image of its associated absolute Galois representation $\rho_A$ is open in $\operatorname{GSp}_{2g}(\hat{\mathbb{Z}})$. We investigate the arithmetic of the…

Let $C$ be a genus $2$ curve over $\mathbb{Q}$. Harvey and Sutherland's implementation of Harvey's average polynomial-time algorithm computes the $\bmod \ p$ reduction of the numerator of the zeta function of $C$ at all good primes $p\leq…

We describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius.…

For primes p congruent to 1 mod 12, we present an explicit relation between the traces of Frobenius on a family of elliptic curves with j-invariant 1728/t and values of a particular 2F1-hypergeometric function over F_p. Additionally, we…

This work is devoted to study of algebraicty modulo p of Siegel's G-functions. Our goal is to emphasize the relevance of the notion of strong Frobenius structure, clasically studied in the theory of the p-adic diffenrential equations, for…

Using an intrinsic $q$-hypergeometric strategy, we generalise Dwork-type congruences $H(p^{s+1})/H(p^s)\equiv H(p^s)/H(p^{s-1})\pmod{p^3}$ for $s=1,2,\dots$ and $p$ a prime, when $H(N)$ are truncated hypergeometric sums corresponding to the…

In this paper, we aim to study traces of Frobenius of certain one parameter families of elliptic curves and their relationships with $p$-adic hypergeometric functions. For example, we consider a DIK family of curves and establish the trace…

We provide a polynomial time algorithm for computing the universal Gr\"obner basis of any polynomial ideal having a finite set of common zeros in fixed number of variables. One ingredient of our algorithm is an effective construction of the…

Motivated by the problems of computing sample covariance matrices, and of transforming a collection of vectors to a basis where they are sparse, we present a simple algorithm that computes an approximation of the product of two n-by-n real…