Processing Math: Done
jsMath
Differences between revisions 12 and 13
Revision 12 as of 2013-02-04 08:41:23
Size: 1950
Editor: fschulze
Comment:
Revision 13 as of 2013-04-24 17:12:56
Size: 1946
Editor: pbruin
Comment: Changed "> 48" to "51"
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
= Sage Days X > 48 = = Sage Days 51 =

Sage Days 51

From 22­-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. It is desirable to implement two different frameworks, each with its own advantages: one developed by F. Hess and the other developed by K. Khuri-Makdisi. This project is motivated by the other two projects.
  • The second project is to work 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.

  • The third project is to work 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 (in preparation).

  • A possible fourth project might be to speed 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 2^16 by a factor of 10. If you are interested in working on this, please let us know.

For further information, contact one of the organizers: Peter Bruin Maarten Derickx Michiel Kosters

sagedaysleiden (last edited 2023-06-01 15:55:47 by mkoeppe)