NTS Spring 2013/Abstracts: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
(→‎January 31: prettify)
(→‎January 31: add parenthetical)
Line 26: Line 26:
| bgcolor="#BCD2EE"  |   
| bgcolor="#BCD2EE"  |   
Abstract: Consider an elliptic curve ''E''.  The explicit formula for ''E'' relates a sum involving the numbers ''a<sub>p''</sub>(''E'') to a sum of three quantities, one involving the analytic rank of the curve, another involving the zeros of the ''L''-series of the curve, and the third, a bounded error term.    Barry Mazur and I are attempting to see how numerically explicit – for particular examples – we can make each term in this formula.  I'll explain this adventure in a bit more detail, show some plots, and explain what they represent.
Abstract: Consider an elliptic curve ''E''.  The explicit formula for ''E'' relates a sum involving the numbers ''a<sub>p''</sub>(''E'') to a sum of three quantities, one involving the analytic rank of the curve, another involving the zeros of the ''L''-series of the curve, and the third, a bounded error term.    Barry Mazur and I are attempting to see how numerically explicit – for particular examples – we can make each term in this formula.  I'll explain this adventure in a bit more detail, show some plots, and explain what they represent.
(This is joint work with Barry Mazur).
|}                                                                         
|}                                                                         
</center>
</center>

Revision as of 03:12, 17 January 2013

January 24

Tamar Ziegler (Technion)
Title: tba

Abstract: tba


January 31

William Stein (U. of Washington)
Title: How explicit is the explicit formula?

Abstract: Consider an elliptic curve E. The explicit formula for E relates a sum involving the numbers ap(E) to a sum of three quantities, one involving the analytic rank of the curve, another involving the zeros of the L-series of the curve, and the third, a bounded error term. Barry Mazur and I are attempting to see how numerically explicit – for particular examples – we can make each term in this formula. I'll explain this adventure in a bit more detail, show some plots, and explain what they represent.

(This is joint work with Barry Mazur).


February 7

Nigel Boston (Madison)
Title: A refined conjecture on factoring iterates of polynomials over finite fields

Abstract: tba



Organizer contact information

Robert Harron

Zev Klagsbrun

Sean Rostami


Return to the Number Theory Seminar Page

Return to the Algebra Group Page