Curves over every global field violating the local-global principle

From MaRDI portal
(Redirected from Publication:393236)




Abstract: There is an algorithm that takes as input a global field k and produces a curve over k violating the local-global principle. Also, given a global field k and a nonnegative integer n, one can effectively construct a curve X over k such that #X(k)=n and X has points over every completion of k.









This page was built for publication: Curves over every global field violating the local-global principle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393236)