Open BarinderBanwait opened 4 years ago
Make the following algorithm:
INPUT: genus 2 curve over Q OUTPUT: the non-semistable reduction primes of its Jacobian
It's probably just the primes dividing the conductor with some condition on the exponent
I had a chat with Céline and Vlad; apparently they're in a good spot to have their group implement this in sage; it's Definition 1.7/Theorem 1.8 in this paper: https://arxiv.org/pdf/1808.02936.pdf
Make the following algorithm:
INPUT: genus 2 curve over Q OUTPUT: the non-semistable reduction primes of its Jacobian
It's probably just the primes dividing the conductor with some condition on the exponent