Size: 6544
Comment:
|
Size: 6669
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 13: | Line 13: |
On convergence in the Sato-Tate conjecture (application of Sage to studying how quickly convergence happens in the Sato-Tate conjecture; this leads to a new conjecture. This is joint work with Barry Mazur. | Abstract: This is a talk on convergence in the Sato-Tate conjecture, in particular, it is an application of Sage to studying how quickly convergence happens in the Sato-Tate conjecture; this in fact leads to a new conjecture and new questions. This is joint work with Barry Mazur. |
Line 27: | Line 27: |
This is a talk about some work in progress which involves identities between |
Abstract: This is a talk about some work in progress which involves identities between |
Line 46: | Line 46: |
I'll give a short overview of the state of affairs of modular forms in SAGE. Mostly, I'll detail what we can do, what MAGMA can do that we can't, and some speed comparisons. | Abstract: I'll give a short overview of the state of affairs of modular forms in SAGE. Mostly, I'll detail what we can do, what MAGMA can do that we can't, and some speed comparisons. |
Line 79: | Line 79: |
I will cover libSINGULAR (with some examples, to show that the code isn't as scary as people believe), a bit of PolyBoRi, maybe something about CoCoALib, some benchmarks, and stuff we desperately need and don't know how to get. Obviously, I would throw in some benchmarks and stuff. Actually, I would like to add some (unrelated) slides on the state of sparse linear algebra over finite fields. That would cover what package can do it (not many!) and how SAGE is in that area (surprisingly good it seems for now) and what is done to improve it. Also, someone in the audience might have some input on William's echelon via solve idea adapted to this setting. | Abstract: I will cover libSINGULAR (with some examples, to show that the code isn't as scary as people believe), a bit of PolyBoRi, maybe something about CoCoALib, some benchmarks, and stuff we desperately need and don't know how to get. Obviously, I would throw in some benchmarks and stuff. Actually, I would like to add some (unrelated) slides on the state of sparse linear algebra over finite fields. That would cover what package can do it (not many!) and how SAGE is in that area (surprisingly good it seems for now) and what is done to improve it. Also, someone in the audience might have some input on William's echelon via solve idea adapted to this setting. |
Line 87: | Line 87: |
FLINT is a C library, in the very early stages of development, which has the aim of extending the state of the art in core arithmetic computations and eventually algebraic number theory. We will briefly discuss progress that has been made so far in polynomial and integer arithmetic, including a new variant/implementation of Mulder's recursive polynomial "short division" algorithm which we have worked up for doing faster polynomial division. | Abstract: FLINT is a C library, in the very early stages of development, which has the aim of extending the state of the art in core arithmetic computations and eventually algebraic number theory. We will briefly discuss progress that has been made so far in polynomial and integer arithmetic, including a new variant/implementation of Mulder's recursive polynomial "short division" algorithm which we have worked up for doing faster polynomial division. |
Line 127: | Line 127: |
In this controversial talk, I will describe the "right" way to discover coercion and explain why the idea of using base extension is wrong. | Abstract: In this controversial report, I will describe the "right" way to discover coercion and explain why the idea of using base extension is wrong. |
Sage Days 5 Schedule
SATURDAY
7pm -- Dinner at [http://www.penangusa.com/location_cambridge_menu_dinein.html Penang] in Harvard Square; 57 JFK Street, Harvard Square, Cambridge, MA 02138.
SUNDAY
MORNING TALK 1 (9:15-10:15)
Speaker: William Stein Title: On convergence in the Sato-Tate conjecture
Abstract: This is a talk on convergence in the Sato-Tate conjecture, in particular, it is an application of Sage to studying how quickly convergence happens in the Sato-Tate conjecture; this in fact leads to a new conjecture and new questions. This is joint work with Barry Mazur.
MORNING TALK 2 (10:30-11:30)
Speaker: David Roe Title: p-adic Arithmetic in SAGE
Abstract: I will outline the current status of
AFTERNOON TALK (1-2)
Speaker: Fernando Rodriguez-Villegas Title: Identities between p-adic multi-polylogs and p-adic zeta values
Abstract: This is a talk about some work in progress which involves identities between
ORGANIZATIONAL MEETING After the afternoon talk today we will have an organizational meeting to discuss the plan for working groups for the remainder of the workshop.
EVENING REPORTS (7-8)
Speaker: William Stein and/or Robert Bradshaw Title: Algebraic Number Theory in SAGE, a Status Report
Speaker: Craig Citro Title: Modular forms in SAGE: A status report
Abstract: I'll give a short overview of the state of affairs of modular forms in SAGE. Mostly, I'll detail what we can do, what MAGMA can do that we can't, and some speed comparisons.
EVENING WORKING SESSION (8pm-?)
MONDAY
MORNING TALK 1
Speaker: Amnon Besser Title: On the Computation of p-adic Height Pairings on Jacobians of Hyperelliptic Curves
Abstract: The talk will present an algorithm for the computation of
MORNING TALK 2
Speaker: Robert Bradshaw & Kiran Kedlaya Title: Coleman integration
AFTERNOON TALK
Speaker: Martin Albrecht Title: Commutative Algebra and Sparse Linear Algebra in SAGE (Singular, PolyBoRi)
Abstract: I will cover libSINGULAR (with some examples, to show that the code isn't as scary as people believe), a bit of PolyBoRi, maybe something about CoCoALib, some benchmarks, and stuff we desperately need and don't know how to get. Obviously, I would throw in some benchmarks and stuff. Actually, I would like to add some (unrelated) slides on the state of sparse linear algebra over finite fields. That would cover what package can do it (not many!) and how SAGE is in that area (surprisingly good it seems for now) and what is done to improve it. Also, someone in the audience might have some input on William's echelon via solve idea adapted to this setting.
EVENING REPORTS
Speaker: Bill Hart Title: A short talk on short division : FLINT (Fast Library for Number Theory) a status report by Bill Hart.
Abstract: FLINT is a C library, in the very early stages of development, which has the aim of extending the state of the art in core arithmetic computations and eventually algebraic number theory. We will briefly discuss progress that has been made so far in polynomial and integer arithmetic, including a new variant/implementation of Mulder's recursive polynomial "short division" algorithm which we have worked up for doing faster polynomial division.
Speaker: Michael Abshoff Title: Managing the SAGE development workflow
EVENING WORKING SESSION (8pm-?)
TUESDAY
MORNING TALK 1
Speaker: Gonzalo Tornaria Title: Stark-Heegner points and the Shimura correspondence
MORNING TALK 2
Speaker: Dimitar Jetchev Title: Computing Heegner points
AFTERNOON TALK
Speaker: Michael Abshoff Title: [Ap]CoCoALib
EVENING REPORTS
Speaker: Robert Bradshaw Title: Cython status report
Speaker: Robert Bradshaw Title: Coercion Status Report
Abstract: In this controversial report, I will describe the "right" way to discover coercion and explain why the idea of using base extension is wrong.
EVENING WORKING SESSION (8pm-?)
WEDNESDAY
MORNING TALK 1
Speaker: J-P. Serre Location: Science Center 507 Title: Finite Groups in Number Theory (part 3)
MORNING TALK 2
Speaker: William Stein Title: Computing p-adic Invariants of Elliptic Curves and Applications of Iwasawa theory to BSD
AFTERNOON
Speaker: Moderator Project Wrap-up
3pm NUMBER THEORY SEMINAR:
Title: Ranks of Elliptic Curves Speaker: Mark Watkins Location: Science Center 507 (Harvard)
EVENING WORKING SESSION:
Informal working and coding session for people still around (e.g., William Stein, David Roe, etc.)