Related papers: Counting points on varieties over finite fields of…

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…

We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

We introduce a zeta function counting imaginary quadratic number fields by their class numbers. It is proved that such a function is rational depending only on the eight roots of unity of degrees $1$ and $2$. As a corollary, one gets a…

A possible connection between quantum computing and Zeta functions of finite field equations is described. Inspired by the 'spectral approach' to the Riemann conjecture, the assumption is that the zeroes of such Zeta functions correspond to…

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}\),…

We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…

In this paper we provide an algorithm to classify groups of points on abelian threefolds over finite fields. The classification is given in terms of the Weil polynomial of abelian varieties in a given $\mathbb{F}_q$-isogeny class. This work…

We extend the approach Abbott, Kedlaya and Roe to computation of the zeta function of a projective hypersurface with $\tau$ isolated ordinary double points over a finite field $\mathbb{F}_q$ given by the reduction of a homogeneous…

This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian…

Let $X$ be an algebraic variety over a finite field $\bF_q$, homogeneous under a linear algebraic group. We show that the number of rational points of $X$ over $\bF_{q^n}$ is a periodic polynomial function of $q^n$ with integer…

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…

Igusa's local zeta function $Z_{f,p}(s)$ is the generating function that counts the number of integral roots, $N_{k}(f)$, of $f(\mathbf x) \bmod p^k$, for all $k$. It is a famous result, in analytic number theory, that $Z_{f,p}$ is a…

We discuss computation of the special values of partial zeta functions associated to totally real number fields. The main tool is the \emph{Eisenstein cocycle} $\Psi $, a group cocycle for $GL_{n} (\Z )$; the special values are computed as…

The original article expressed the special values of the zeta function of a variety over a finite field in terms of the $\hat{Z}$-cohomology of the variety. As the article was being completed, Lichtenbaum conjectured the existence of…

Let $q$ be an odd prime power, and $H_{d,q}$ denote the set of square-free monic polynomials $D(x) \in F_q[x]$ of degree $d$. Katz and Sarnak showed that the moments, over $H_{d,q}$, of the zeta functions associated to the curves…

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…

We prove the rationality of some zeta functions associated tocharacters of pro-p groups of finite rank.

This note continues the theoretical development of deterministic integer factorization algorithms based on systems of polynomials equations. The main result establishes a new deterministic time complexity bench mark in integer…