Answers are grounded in this paper and cite their sources.
Let X X be a smooth projective hypersurface over a finite field k k of characteristic p p . We address the problem of practically computing the zeta function $$Z(X,T)$$ Z ( X , T ) of X X (equivalently, the point counts #X(Fq) # X ( F q ) , where q = pⁿ q = p n ), and we focus on the case when 7 ≤ p < 50 7 ≤ p < 50 . We use the theoretical framework of the variant of Kedlaya’s algorithm in [1], and we use the technique of controlled reduction as described in [21]. We define an optimization problem that abstracts the key bottleneck in the implementation of controlled reduction. An algorithm that solves this problem is called a reduction policy . We present three reduction policies with different advantages and disadvantages. We also present a high-performance implementation of controlled reduction that contains GPU-optimized linear algebra code and a data structure for linear recurrences that the authors hope can be used to study further reduction policies. Our algorithms get state-of-the-art performance in many cases; for example, we beat [70] or [56] on many examples of quintic curves, while also being able to compute zeta functions of cubic fourfolds when $$p = 7,11$$ p = 7 , 11 . We also have the first (to our knowledge) systematic computations of zeta functions of quintic surfaces. We use our implementation to deduce many new explicit examples of varieties with specified Newton polygons, including cubic fourfolds which are neither ordinary nor supersingular, quartic K3 surfaces of various Artin-Mazur heights, and quintic surfaces of all possible domino numbers.
No takes yet. Share an insight, caveat, or question.
Batubara et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: