Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Gras conjecture in function fields by Euler systems

Published 3 Feb 2011 in math.NT | (1102.0617v1)

Abstract: We use Euler systems to prove the Gras conjecture for groups generated by Stark units in global function fields. The techniques applied here are classical and go back to Thaine, Kolyvagin and Rubin. We obtain our Euler systems from the torsion points of sign-normalized Drinfel'd modules.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.