1 code implementation • 27 May 2020 • Edgar Costa, Kiran S. Kedlaya, David Roe
We describe an algorithm for computing, for all primes $p \leq X$, the mod-$p$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive in time quasilinear in $X$.
Number Theory 11Y16, 33C20 (primary), and 11G09, 11M38, 11T24 (secondary)
1 code implementation • 24 Mar 2020 • Edgar Costa, Emre Can Sertöz
We give an algorithm that takes a smooth hypersurface over a number field and computes a $p$-adic approximation of the obstruction map on the Tate classes of a finite reduction.
Algebraic Geometry Number Theory 14C25, 14C22, 14F30, 14-04
1 code implementation • 25 May 2017 • Edgar Costa, Nicolas Mascot, Jeroen Sijsling, John Voight
We describe several improvements to algorithms for the rigorous computation of the endomorphism ring of the Jacobian of a curve defined over a number field.
Number Theory Algebraic Geometry 11g10, 11Y99, 14K15, 14H40, 14Q05