Computing Crystalline Cohomology and p-Divisible Groups for Curves over Finite Fields
Jeremy Booher

TL;DR
This paper presents a practical algorithm for computing the p-divisible group of a curve over a finite field by leveraging crystalline cohomology and building on Tuitman's p-adic point counting method.
Contribution
It introduces an efficient algorithm to compute the Dieudonné module of the p-divisible group of a curve using crystalline cohomology, extending existing p-adic point counting techniques.
Findings
Algorithm successfully computes the Frobenius and Verschiebung operators.
Implementation demonstrates practical computation for specific curves.
Extends Tuitman's p-adic point counting to p-divisible group analysis.
Abstract
Let be a smooth projective curve over a finite field of characteristic . We describe and implement a practical algorithm for computing the -divisible group via computing its Dieudonn\'{e} module, or equivalently computing the Frobenius and Verschiebung operators on the first crystalline cohomology of . We build on Tuitman's -adic point counting algorithm, which computes the rigid cohomology of and requires a ``nice'' lift of to be provided.
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 · Commutative Algebra and Its Applications
