92 citations · 1.1k across the 51 of their papers we have counts for
5 papers · 1 filter
Computing L-Polynomials of Picard curves from Cartier-Manin matrices
Sualeh Asif, Francesc Fité, Dylan Pentland
We study the sequence of zeta functions of a generic Picard curve defined over at primes of good reduction for . We define a degree 9 po…
On a question of Mordell
Andrew R. Booker, Andrew V. Sutherland
We make several improvements to methods for finding integer solutions to for small values of . We implemented these improvements on Charity Engine's global compu…
Sorting and labelling integral ideals in a number field
John Cremona, Aurel Page, Andrew V. Sutherland
We define a scheme for labelling and ordering integral ideals of number fields, including prime ideals as a special case. The order we define depends only on the choice of a monic…
Counting points on superelliptic curves in average polynomial time
Andrew V. Sutherland
We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over that is substantially faster t…
Computing classical modular forms
Alex J. Best, Jonathan Bober, Andrew R. Booker +8
We discuss practical and some theoretical aspects of computing a database of classical modular forms in the L-functions and Modular Forms Database (LMFDB).