Newton strata realization for hypersurfaces via explicit p-adic cohomology
Ryan Batubara, Jack J Garzella, Yongyuan Huang, Maximus Mellberg

TL;DR
This paper develops optimized algorithms for computing zeta functions of hypersurfaces over finite fields using p-adic cohomology, achieving state-of-the-art performance and new explicit examples.
Contribution
It introduces new reduction policies and GPU-optimized implementation for Kedlaya's algorithm, enabling efficient zeta function computations for complex hypersurfaces.
Findings
Achieved faster zeta function computations for quintic curves and cubic fourfolds.
First systematic computations of zeta functions of quintic surfaces.
Generated new explicit examples of varieties with diverse Newton polygons.
Abstract
Let be a smooth projective hypersurface over a finite field of characteristic . We address the problem of practically computing the zeta function of (equivalently, the point counts , where ), and we focus on the case when . We use the theoretical framework of the variant of Kedlaya's algorithm in arXiv:archive/0601508, and we use the technique of controlled reduction as described in Costa's Thesis. 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Polynomial and algebraic computation · Cryptography and Residue Arithmetic
