|
Size: 1579
Comment:
|
Size: 1583
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 5: | Line 5: |
| * The first project is to enhance the function field functionality of Sage. In particular, it is important to have algorithms for computing with Jacobians of algebraic curves. This project is motivated by the other two projects. | * The first project is to enhance the function field functionality of Sage. In particular, it is important to have algorithms for computing with Jacobians of algebraic curves. This project is motivated by the other two projects. |
| Line 7: | Line 7: |
| * The second project is to work on a new implementation of the algorithm of [[http://press.princeton.edu/titles/9491.html|Edixhoven, Couveignes et al.]] for computing Galois representations attached to modular forms. | * The second project is to work on a new implementation of the algorithm of [[http://press.princeton.edu/titles/9491.html|Edixhoven, Couveignes et al.]] for computing Galois representations attached to modular forms. |
| Line 9: | Line 9: |
| * The third project is to work on computing semi stable models of curves over local fields. To be more precise the goal is to work towards a practical implementation of the algorithms that follow from the proof in: K. Arzdorf and S. Wewers, A local proof of the semistable reduction theorem. | * The third project is to work on computing semi stable models of curves over local fields. To be more precise the goal is to work towards a practical implementation of the algorithms that follow from the proof in: K. Arzdorf and S. Wewers, A local proof of the semistable reduction theorem. |
| Line 11: | Line 11: |
| * A possible fourth project might be to speed up finite fields in sage. Faster finite fields will mean that the algorithms in the previous project will also be significantly faster. According to [[https://groups.google.com/forum/#!msg/sage-nt/4tu8csrrWJo/gxY95f8s5FkJ|a google group discussion]] it should be easy to make finite fiels larger than 2^16 a factor 10 faster. If you are interested in working on this, please let us know. | * A possible fourth project might be to speed up finite fields in sage. Faster finite fields will mean that the algorithms in the previous project will also be significantly faster. According to [[https://groups.google.com/forum/#!msg/sage-nt/4tu8csrrWJo/gxY95f8s5FkJ|a google group discussion]] it should be easy to make finite fiels larger than 2^16 a factor 10 faster. If you are interested in working on this, please let us know. |
Sage Days X > 48
From 22 July till 26 July 2013 there will be a Lorentz Center workshop on Arithmetic Geometry in Sage. There will be three main projects during this week.
- The first project is to enhance the function field functionality of Sage. In particular, it is important to have algorithms for computing with Jacobians of algebraic curves. This project is motivated by the other two projects.
The second project is to work on a new implementation of the algorithm of Edixhoven, Couveignes et al. for computing Galois representations attached to modular forms.
- The third project is to work on computing semi stable models of curves over local fields. To be more precise the goal is to work towards a practical implementation of the algorithms that follow from the proof in: K. Arzdorf and S. Wewers, A local proof of the semistable reduction theorem.
A possible fourth project might be to speed up finite fields in sage. Faster finite fields will mean that the algorithms in the previous project will also be significantly faster. According to a google group discussion it should be easy to make finite fiels larger than 2^16 a factor 10 faster. If you are interested in working on this, please let us know.
For further information, contact one of the organizers: Maarten Derickx Michiel Kosters Peter Bruin