|
Size: 2856
Comment:
|
Size: 2971
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| An edition of the Sage Days titled ''Algorithms in Arithmetic Geometry'' will take place at the [[http://www.lorentzcenter.nl/|Lorentz Center]] in Leiden from 22-26 July 2013. There will be four main (proposed) projects during this week. | An edition of the Sage Days titled ''Algorithms in Arithmetic Geometry'' will take place at the [[http://www.lorentzcenter.nl/|Lorentz Center]] in Leiden from 22-26 July 2013. |
| Line 9: | Line 9: |
| [[https://docs.google.com/document/d/1V1PjF_6a2h_8T9XTGaiBGOwX_0_7Rtap_00jEqbx8HA/|Temporary schedule]] | [[https://docs.google.com/document/d/1V1PjF_6a2h_8T9XTGaiBGOwX_0_7Rtap_00jEqbx8HA/|Preliminary schedule]] |
| Line 13: | Line 13: |
| 1. Speeding up operations with finite fields in Sage. Faster finite fields will mean that the algorithms in the other projects will also be significantly faster. According to [[https://groups.google.com/forum/#!msg/sage-nt/4tu8csrrWJo/gxY95f8s5FkJ|a Google groups discussion]] it should be relatively easy to speed up operations in finite fields of cardinality larger than |
There will be four main (proposed) projects during this week. 1. Speeding up operations with finite fields in Sage. Faster finite fields will mean that the algorithms in the other projects will also be significantly faster. According to [[https://groups.google.com/forum/#!msg/sage-nt/4tu8csrrWJo/gxY95f8s5FkJ|a Google groups discussion]] it should be relatively easy to speed up operations in finite fields of cardinality larger than |
Sage Days 51
An edition of the Sage Days titled Algorithms in Arithmetic Geometry will take place at the Lorentz Center in Leiden from 22-26 July 2013.
For further information, see the workshop webpage or contact one of the organizers: Peter Bruin Maarten Derickx Michiel Kosters
Schedule
Proposed projects
There will be four main (proposed) projects during this week.
Speeding up operations with finite fields in Sage. Faster finite fields will mean that the algorithms in the other projects will also be significantly faster. According to a Google groups discussion it should be relatively easy to speed up operations in finite fields of cardinality larger than
216 by a factor of 10. One solution is now available for testing at Trac #12142. Is it also possible to implement `standard models' of finite fields?Enhancing the function field functionality of Sage. In particular, it is important to have algorithms for computing with Jacobians of algebraic curves. It is desirable to implement two different frameworks, each with its own advantages: one developed by F. Hess (Computing relations in divisor class groups of algebraic curves over finite fields, PDF) and the other developed by K. Khuri-Makdisi (Asymptotically fast group operations on Jacobians of general curves, arXiv:0409209). This project is motivated by the following two projects.
Working on practical implementations of the algorithm described in Edixhoven, Couveignes, Bosman, de Jong, and Merkl for computing Galois representations over finite fields attached to modular forms.
Working on computing semi-stable models of curves over local fields. The goal is a practical implementation of the algorithms that follow from the new proof of Deligne and Mumford's stable reduction theorem in: K. Arzdorf and S. Wewers, A local proof of the semistable reduction theorem, arXiv:1211.4624. This is worked out for superelliptic curves (
yn=f(x) ) withn not divisible by the residue characteristic) by I. Bouw and S. Wewers, ComputingL -functions and semistable reduction of superelliptic curves, arXiv:1211.4459.