Related papers: Using zeta functions to factor polynomials over fi…

We give algorithms to compute isomorphism classes of ordinary abelian varieties defined over a finite field $\mathbb{F}_q$ whose characteristic polynomial (of Frobenius) is square-free and of abelian varieties defined over the prime field…

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 one of his papers, using arguments about l-adic representations, Taniyama expresses the zeta function of an abelian variety over a number field as an infinite product of modified Artin L-functions. The latter can be further decomposed as…

In this paper, we generalize Bernoulli-Goss polynomials, and give a criterion on the divisibility of zeta functions of cyclotomic function fields. As an application of our criterion, for a given polynomial $f(u)$, we prove that there are…

We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.

We present families of (hyper)elliptic curve which admit an efficient deterministic encoding function.

Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of…

We survey some recent applications of p-adic cohomology to machine computation of zeta functions of algebraic varieties over finite fields of small characteristic, and suggest some new avenues for further exploration.

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

Zeta functions of periodic cubical lattices are explicitly derived by computing all the eigenvalues of the adjacency operators and their characteristic polynomials. We introduce cyclotomic-like polynomials to give factorization of the zeta…

In this article we prove lower and upper bounds for class numbers of algebraic curves defined over finite fields. These bounds turn out to be better than most of the previously known bounds obtained using combinatorics. The methods used in…

We give an algorithm to determine factorization types of primes in the number fields generated by a single point of odd order on an elliptic curve. We apply this to compute coefficients of the Dedekind zeta function of the field.

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…

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…

We estimate the fraction of isogeny classes of abelian varieties over a finite field which have a given characteristic polynomial P(T) modulo l. As an application we find the proportion of isogeny classes of abelian varieties with a…

We study the distribution of algebraic points on curves in abelian varieties over finite fields.

With tools of measure theory and symbols of matrix sequences, we explore the results regarding curves on finite fields and Weil Systems. This document wants to draw a bridge between the two areas and link the concepts of distribution of…

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…

Though Joyal's species are known to categorify generating functions in enumerative combinatorics, they also categorify zeta functions in algebraic geometry. The reason is that any scheme $X$ of finite type over the integers gives a "zeta…