Recognition: unknown
Computing Zeta Functions of Cyclic Covers in Large Characteristic
classification
🧮 math.NT
math.AG
keywords
algorithmcharacteristiccycliccoverskedlayalargezetaalves
read the original abstract
We describe an algorithm to compute the zeta function of a cyclic cover of the projective line over a finite field of characteristic $p$ that runs in time $p^{1/2 + o(1)}$. We confirm its practicality and effectiveness by reporting on the performance of our SageMath implementation on a range of examples. The algorithm relies on Gon\c{c}alves's generalization of Kedlaya's algorithm for cyclic covers, and Harvey's work on Kedlaya's algorithm for large characteristic.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.