In 2005, Kayal suggested that Schoofs algorithm for counting points on elliptic curves over finite fields might yield an approach to factor polynomials over finite fields in deterministic polynomial time. We present an exposition of his idea and then explain details of a generalization involving Pilas algorithm for abelian varieties.
If the $ell$-adic cohomology of a projective smooth variety, defined over a $frak{p}$-adic field $K$ with finite residue field $k$, is supported in codimension $ge 1$, then any model over the ring of integers of $K$ has a $k$-rational point. This slightly improves our earlier result math/0405318: we needed there the model to be regular (but then our result was more general: we obtained a congruence for the number of points, and $K$ could be local of characteristic $p>0$).
If the $ell$-adic cohomology of a projective smooth variety, defined over a local field $K$ with finite residue field $k$, is supported in codimension $ge 1$, then every model over the ring of integers of $K$ has a $k$-rational point. For $K$ a $p$-adic field, this is math/0405318, Theorem 1.1. If the model $sX$ is regular, one has a congruence $|sX(k)|equiv 1 $ modulo $|k|$ for the number of $k$-rational points 0704.1273, Theorem 1.1. The congruence is violated if one drops the regularity assumption.
We compute the complete set of candidates for the zeta function of a K3 surface over F_2 consistent with the Weil conjectures, as well as the complete set of zeta functions of smooth quartic surfaces over F_2. These sets differ substantially, but we do identify natural subsets which coincide. This gives some numerical evidence towards a Honda-Tate theorem for transcendental zeta functions of K3 surfaces; such a result would refine a recent theorem of Taelman, in which one must allow an uncontrolled base field extension.
In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds on multiplicative character sums, and characterizations of permutation polynomials.
In this paper, we present three classes of complete permutation monomials over finite fields of odd characteristic. Meanwhile, the compositional inverses of these complete permutation polynomials are also proposed.