We describe a general algorithm for computing intersection pairings on arithmetic surfaces. We have implemented our algorithm for curves over Q Q , and we show how to use it to compute regulators for a number of Jacobians of smooth plane quartics, and to numerically verify the conjecture of Birch and Swinnerton-Dyer for the Jacobian of the split Cartan curve of level 13, up to squares.
No takes yet. Share an insight, caveat, or question.
Bommel et al. (2019) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: