Suppose E is an elliptic curve defined over a number field k, K/k is a quadratic extension, p is an odd prime, and L is a p-extension of K that is Galois over K. Let c be an element of order 2 in Gal(L/k), and H the subgroup of all elements of G := Gal(L/K) that commute with c. Under very mild hypotheses the Parity Conjecture (combined with a little representation theory) predicts that if the rank of E(K) is odd, then the rank of E(L) is at least [G:H]. For example, if L/k is dihedral and the rank of E(K) is odd, then the rank of E(L) should be at least [L:K].
In this talk I will discuss recent joint work with Barry Mazur, where we prove an analogue of this result with "rank" repaced by "p-Selmer rank".
This will be a series of two introductory lectures on the
distribution of closed points on a scheme of finite type
over the integers. Both general properties and important
examples will be discussed, with an emphasis on p-adic
variation for zeta functions over finite fields.
An explicit expression for the L-function evaluator associated to an abelian extension K/k of number fields of degree 2p will be discussed. Instances will be given where this expression can be used to determine pieces of the ideal class group of K that are annihilated by this L-function evaluator.
Motivated by the construction made by Goppa on curves, we present some error-correcting codes on algebraic surfaces. A surface whose Neron-Severi group has rank 1 has a "nice" intersection property that allows us the construction of a good code. We will verify this on specific examples. Surfaces with many points and rank 1 are not easy to find. We were able, though, to find also surfaces with low rank and many points, and these gave us good codes too. Finally, we present a decoding algorithm for these codes. It is based on the realization of the code as a LDPC code, and it is inspired on the Luby-Mitzenmacher algorithm.
I will explain how to produce, for any given number N, an elliptic curve over a finite field having exactly N points. If N is prime, the heuristic run time is polynomial in log(N).
Given an arbitrary polynomial f in n variables over a finite field k, it is known that for a generic linear form l the exponential sum associated to f(x)+l(x) is pure. However, the proof is non-constructive and gives no explicit description of the set of such l's. In this talk we will give some results and conjectures related to the problem of giving an explicit geometric description of this set.