paper

Curves over every global field violating the local-global principle

arXiv:0902.3965 · doi:10.1007/s10958-010-0182-9

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.

5 pages

References in corpus (4)

Cited by in corpus (1)