2024-01-30 15:20 UTC
My newest paper! For many years — at least since 2001, when I first read a paper by Daniel Maisner and Enric Nart that involved gathering data about hyperelliptic curves over small finite fields — I wondered whether there was an elementary way to enumerate all such curves efficiently.
Turns out, there is! Using pretty straightforward techniques, the algorithm I present will write down all hyperelliptic curves of genus g over a finite field 𝐅_q exactly once, in time proportional to the number of such curves (times some logarithmic factors).
In the case of curves of genus 2, my algorithm, implemented in Magma, runs about 90 times faster than Magma’s own built-in functions for this.
https://arxiv.org/abs/2401.15255
Replies (1)
-
@however@tech.lgbt 2024-02-01 17:29
And of course, even after numerous editing run-throughs, I still missed the typo in the FIRST SENTENCE of the abstract. D’oh!