Size: 1624
Comment: Fix link
|
Size: 10528
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 6: | Line 6: |
Line 9: | Line 8: |
== Organizers == * [[MichaelAbshoff|Michael Abshoff]], [[http://www.informatik.uni-bremen.de/~malb/|Martin Albrecht]], [[http://www.warwick.ac.uk/~masgaj/|John Cremona]], [[http://www-ma2.upc.es/~quer/|Jordi Quer]], [[http://wstein.org|William Stein]], [[http://www.uam.es/personal_pdi/ciencias/engonz/|Enrique González-Jiménez]], [[http://polit.upc.es/~puig/indexen.html|Joaquim Puig]]. == Participants == 1. Michael Abshoff 1. Martin Albrecht 1. Wouter Castryck 1. Christian Eder 1. Burcin Erocal 1. Jordi Guàrdia 1. David Loeffler 1. Robert Miller 1. Joaquim Puig 1. Jordi Quer 1. Emmanuel Thome 1. Gonzalo Tornaria 1. William Stein 1. Brian Wyman |
|
Line 29: | Line 9: |
Line 35: | Line 14: |
* Monday, June 22: [[http://www.crm.es/Conferences/IndexThematicDaysEng.htm|CRM Thematic Day on Mathematics and Computation]] * Tuesday, June 23: |
||||||<tablestyle="width: 80%" style="background-color: #E0E0FF;">Monday, June 22|| ||||||[[http://www.crm.cat/Conferences/0809/ThematicDays/SageDay/index.htm|CRM Thematic Day on Mathematics and Computation]]|| ||<|2>10:30-11:30||<|2> William Stein || '''Sage: open source mathematical software''' || || This will be an overview talk about Sage, which explains the history and motivation for the project, demos some key features of Sage, and discusses where we are going next. It will be accessible to people in all research areas and assumes no prior experience with Sage. || ||11:30-12:00||Coffee Break|||| ||<|2>12:00-13:00||<|2> Henri Cohen || '''Experimental methods in number theory and analysis''' || || In this talk, I would like to give a number of examples of numerical experiments coming from number theory and analysis, mention the tools used to perform them, and show how they sometimes can lead to interesting and deep conjectures. || ||<|2>14:30-15:30||<|2> Àngel Jorba || '''Developing tailored software for specific problems''' || || We will discuss the advantages and inconveniences of developing software (in a general purpose language like C) for concrete problems. I will also mention the results of a pool done by the Spanish project "i-Math" on the use of computational resources of the mathematical research groups in Spain. || ||15:30-16:00||Coffee Break|||| ||16:00-17:00||Round Table|||| ||||||FME|| ||19:00--||Coding Sprint Organization|||| ||||||<tablestyle="width: 80%" style="background-color: #E0E0FF;">Tuesday, June 23|| ||||||FME|| ||<|2>10:30-11:30||<|2> Jordi Guàrdia || '''New ideas for computing integral bases''' || || The determination of the ring of integers of a number field is one of the main tasks of computational algebraic number theory. The use of higher Newton polygons provides a new insight in the problem, leading to a fast method to compute integral bases, discriminants and prime ideal factorization in number fields. || ||11:30-12:00||Coffee Break|||| ||<|2>12:00-13:00||<|2>William Stein|| '''How to use Sage to compute with Elliptic Curves''' || || I will explain how to use Sage to define elliptic curves over various fields, do arithmetic on them, and compute standard invariants. Then I'll talk about elliptic curves over finite fields, and how to count points and compute the group structure. Next, I'll talk about elliptic curves over number fields and Sage's implementation of Tate's algorithm. Finally, I'll discuss computing the invariants in the BSD conjecture for elliptic curves over QQ. || ||13:00-14:30||Lunch|||| ||<|2>14:30-15:30||<|2>Clement Pernet & Majid Khonji|| '''Computing exactly with unsafe ressources: fault tolerant exact linear algebra and cloud computing''' || || In several ways, challenges in computational mathematics (including computational number theory, graph theory, cryptanalysis, ...) involve large linear algebra computations over Z or Q. Distributed, peer-to-peer or Cloud computing represent nowadays the best perspectives to access to a large and cheap computing power, but based on unrealible ressources. Fault tolerant techniques are therefore developped in order to increase the confidence in the computations, or even to certify it. In the case of exact computations, the algebraic properties of the problems are well suited for the developpment of algorithm based fault tolerant protocols. In particular, the Chinese Remaindering Algorithm, offering an embarassingly easy parallelization, can be adapted to work as an error correcting code and tolerate errors. We will present an demonstrate these algorithms and protocols in the case of a distributed computation of the determinant of a matrix over Z. || ||<|2>15:30-16:30||<|2>Martin Albrecht|| '''How to get started developing Sage''' || || In this talk, we will try to highlight a few interesting and relevant bits and pieces for getting into Sage development. We will give an overview of how Sage is structured and step through the Sage development process. The talk is meant to be fairly interactive with people asking questions etc. || || Free evening|| Sant Joan festivity |||| ||||||<tablestyle="width: 80%" style="background-color: #E0E0FF;">Wednesday, June 24|| ||||||FME|| ||<|2>13:00-14:00||<|2> William Stein || '''Modular forms and modular abelian varieties in Sage''' || || I will survey the capabilities in Sage for computing dimensions of modular forms spaces, congruence subgroups, modular symbols, modular forms, Brandt modules, overconvergent modular forms, half-integral weight forms, and modular abelian varieties. I will discuss both what is in Sage, and what is missing. || ||<|2>14:30 -15:30||<|2>Christian Eder|| '''Faugere's F5 Algorithm: variants and implementation issues''' || || In this talk we shortly recall main properties of Gröbner bases used for their computations. After an introduction on Faugere's F5 Algorithm we examine its points of inefficiency, especially the reduction process, and present the variant F5C improving these. The benefits of this improvement are explained and represented in detail. Moreover some hints implementing F5's data structures are given and the positive effects of F5C on these are shown. In the end we give some insight into the implementation of F5's reduction process in an F4-ish manner, i.e. using symbolic preprocessing. || || 16:00--||Coding Sprint|||| ||||||<tablestyle="width: 80%" style="background-color: #E0E0FF;">Thursday, June 25|| ||||||FME|| ||<|2>10:30-11:30||<|2> David Loeffler || TBA || || || || 11:30-12:00 || Coffee Break || || ||<|2>12:00-13:00||<|2> David Kohel || '''ECHIDNA: Open source Magma extensions for Sage''' || || I will present the open source GPL repository of Magma code:<<BR>>Elliptic Curves and Higher Dimensional Analogues<<BR>>(http://echidna.maths.usyd.edu.au/kohel/alg/), <<BR>> with associated databases, and its use as an extension to Sage. This repository includes updates to the original packages for quaternion algebras, Brandt modules and generalization of my code for genera of lattices (as a quadratic modules package). As new features, it includes p-adic point counting via canonical lifts for elliptic curves (AGM-X_0(N)), extensions to the Igusa invariants and Mestre's algorithm (to small characteristic) in genus 2, arithmetic of CM fields and CM constructions for curves of genus 2, invariants of genus 3 curves (Dixmier-Ohno and Shioda's hyperelliptic invariants), and numerous other features (e.g. working in generic Picard groups, singular cubic curves and generalized Jacobians of singular hyperelliptics, etc.). The majority of the algorithms are completely new to Magma, and represent algorithms developed over more than decade (with students and collaborators). The Sage developer community is invited to contribute, document, and improve ECHIDNA, and port features directly to Sage. || ||13:00-14:30|| Lunch |||| ||<|2>14:30-15:30||<|2>Robert Miller|| '''Fast compiled graphs in Sage''' || || There will be a demonstration and advertisement of new developments in graph theory in Sage. In particular, compiled Sage graphs have finally reached the same level of functionality as NetworkX graphs, the slower Python implementation. || ||16:00--|| Coding Sprint |||| |
Line 41: | Line 66: |
== Organizers == * [[MichaelAbshoff|Michael Abshoff]], [[http://www.informatik.uni-bremen.de/~malb/|Martin Albrecht]], [[http://www.warwick.ac.uk/~masgaj/|John Cremona]], [[http://www-ma2.upc.es/~quer/|Jordi Quer]], [[http://wstein.org|William Stein]], [[http://www.uam.es/personal_pdi/ciencias/engonz/|Enrique González-Jiménez]], [[http://polit.upc.es/~puig/indexen.html|Joaquim Puig]], [[http://www.cmat.edu.uy/~tornaria/|Gonzalo Tornaría]]. == Participants == 1. Michael Abshoff, Technische Universität Dortmund 1. Martin Albrecht, University of London 1. Maite Aranes, University of Warwick 1. Tomasz Buchert, Adam Mickiewicz University 1. Michal Bulant, Masaryk University 1. Gabriel Cardona, Universitat de les Illes Balears 1. Wouter Castryck, Leuven 1. Henri Cohen, Bordeaux 1. Francesc Creixell, UPC 1. Christian Eder, TU Kaiserslautern 1. Burcin Erocal, RISC, JKU - Linz 1. Julio Fernández, UPC 1. Imma Gálvez, UAB 1. Enrique González-Jimenez, Universidad Autónoma de Madrid 1. Josep González, UPC 1. Jordi Guàrdia, UPC 1. Xavier Guitart, UPC 1. Amir Hashemi, Isfahan University of Technology (Iran) 1. Nikolas Karalis, National Technical University of Athens 1. Hamish Ivey-Law, Sydney-Marseille 1. David Kohel, Institut de Mathématiques de Luminy 1. Joan Carles Lario, UPC 1. Offray Vladimir Luna Cárdenas, Javeriana (Colombia) 1. David Loeffler, University of Cambridge 1. Robert Miller, University of Washington 1. Antonio Molina, Addlink Software Científico 1. Enric Nart, UAB 1. Sebastian Pancratz, University of Oxford 1. Clement Pernet 1. Joaquim Puig, UPC 1. Jordi Quer, UPC 1. Anna Río, UPC 1. Víctor Rotger, UPC 1. Bjarke Roune, University of Aarhus 1. Utpal Sarkar, HP (+UPC) 1. Diana Savin, Ovidius University (Romania) 1. Rainer Schulze-Pillot, Universitaet des Saarlandes 1. Mehmet Sengun, University of Duisburg-Essen 1. Jaap Spies, Holland 1. William Stein, University of Washington 1. Emmanuel Thome, INRIA Lorraine 1. Andrew Tonks, London Metropolitan University 1. Gonzalo Tornaría, Universidad de la República (Uruguay) 1. Eulàlia Tramuns, UPC 1. Montrserrat Vela, UPC 1. Preston Wake, !McMaster 1. Christian Wuthrich, University of Nottingham 1. Brian Wyman, Univ of Michigan |
Sage Days 16: Barcelona, Spain -- Computational Number Theory
Sage Days 16 will take place June 22-27, 2009, the week after MEGA 2009. The event will be organised by the CRM (http://www.crm.cat) and the OSRM of the UPC (http://www-fme.upc.edu/osrm/), and will take place at the FME, in the campus of the UPC, in Barcelona.
Mailing lists
Participants lists (open): http://groups.google.com/group/sagedays16
Organizers list (closed): http://groups.google.com/group/sagedays16-org
Schedule
Monday, June 22 |
||
10:30-11:30 |
William Stein |
Sage: open source mathematical software |
This will be an overview talk about Sage, which explains the history and motivation for the project, demos some key features of Sage, and discusses where we are going next. It will be accessible to people in all research areas and assumes no prior experience with Sage. |
||
11:30-12:00 |
Coffee Break |
|
12:00-13:00 |
Henri Cohen |
Experimental methods in number theory and analysis |
In this talk, I would like to give a number of examples of numerical experiments coming from number theory and analysis, mention the tools used to perform them, and show how they sometimes can lead to interesting and deep conjectures. |
||
14:30-15:30 |
Àngel Jorba |
Developing tailored software for specific problems |
We will discuss the advantages and inconveniences of developing software (in a general purpose language like C) for concrete problems. I will also mention the results of a pool done by the Spanish project "i-Math" on the use of computational resources of the mathematical research groups in Spain. |
||
15:30-16:00 |
Coffee Break |
|
16:00-17:00 |
Round Table |
|
FME |
||
19:00-- |
Coding Sprint Organization |
|
Tuesday, June 23 |
||
FME |
||
10:30-11:30 |
Jordi Guàrdia |
New ideas for computing integral bases |
The determination of the ring of integers of a number field is one of the main tasks of computational algebraic number theory. The use of higher Newton polygons provides a new insight in the problem, leading to a fast method to compute integral bases, discriminants and prime ideal factorization in number fields. |
||
11:30-12:00 |
Coffee Break |
|
12:00-13:00 |
William Stein |
How to use Sage to compute with Elliptic Curves |
I will explain how to use Sage to define elliptic curves over various fields, do arithmetic on them, and compute standard invariants. Then I'll talk about elliptic curves over finite fields, and how to count points and compute the group structure. Next, I'll talk about elliptic curves over number fields and Sage's implementation of Tate's algorithm. Finally, I'll discuss computing the invariants in the BSD conjecture for elliptic curves over QQ. |
||
13:00-14:30 |
Lunch |
|
14:30-15:30 |
Clement Pernet & Majid Khonji |
Computing exactly with unsafe ressources: fault tolerant exact linear algebra and cloud computing |
In several ways, challenges in computational mathematics (including computational number theory, graph theory, cryptanalysis, ...) involve large linear algebra computations over Z or Q. Distributed, peer-to-peer or Cloud computing represent nowadays the best perspectives to access to a large and cheap computing power, but based on unrealible ressources. Fault tolerant techniques are therefore developped in order to increase the confidence in the computations, or even to certify it. In the case of exact computations, the algebraic properties of the problems are well suited for the developpment of algorithm based fault tolerant protocols. In particular, the Chinese Remaindering Algorithm, offering an embarassingly easy parallelization, can be adapted to work as an error correcting code and tolerate errors. We will present an demonstrate these algorithms and protocols in the case of a distributed computation of the determinant of a matrix over Z. |
||
15:30-16:30 |
Martin Albrecht |
How to get started developing Sage |
In this talk, we will try to highlight a few interesting and relevant bits and pieces for getting into Sage development. We will give an overview of how Sage is structured and step through the Sage development process. The talk is meant to be fairly interactive with people asking questions etc. |
||
Free evening |
Sant Joan festivity |
|
Wednesday, June 24 |
||
FME |
||
13:00-14:00 |
William Stein |
Modular forms and modular abelian varieties in Sage |
I will survey the capabilities in Sage for computing dimensions of modular forms spaces, congruence subgroups, modular symbols, modular forms, Brandt modules, overconvergent modular forms, half-integral weight forms, and modular abelian varieties. I will discuss both what is in Sage, and what is missing. |
||
14:30 -15:30 |
Christian Eder |
Faugere's F5 Algorithm: variants and implementation issues |
In this talk we shortly recall main properties of Gröbner bases used for their computations. After an introduction on Faugere's F5 Algorithm we examine its points of inefficiency, especially the reduction process, and present the variant F5C improving these. The benefits of this improvement are explained and represented in detail. Moreover some hints implementing F5's data structures are given and the positive effects of F5C on these are shown. In the end we give some insight into the implementation of F5's reduction process in an F4-ish manner, i.e. using symbolic preprocessing. |
||
16:00-- |
Coding Sprint |
|
Thursday, June 25 |
||
FME |
||
10:30-11:30 |
David Loeffler |
TBA |
|
||
11:30-12:00 |
Coffee Break |
|
12:00-13:00 |
David Kohel |
ECHIDNA: Open source Magma extensions for Sage |
I will present the open source GPL repository of Magma code: |
||
13:00-14:30 |
Lunch |
|
14:30-15:30 |
Robert Miller |
Fast compiled graphs in Sage |
There will be a demonstration and advertisement of new developments in graph theory in Sage. In particular, compiled Sage graphs have finally reached the same level of functionality as NetworkX graphs, the slower Python implementation. |
||
16:00-- |
Coding Sprint |
- Wednesday, June 24:
- Thursday, June 25:
- Friday, June 26:
- Saturday, June 27:
Organizers
Michael Abshoff, Martin Albrecht, John Cremona, Jordi Quer, William Stein, Enrique González-Jiménez, Joaquim Puig, Gonzalo Tornaría.
Participants
- Michael Abshoff, Technische Universität Dortmund
- Martin Albrecht, University of London
- Maite Aranes, University of Warwick
- Tomasz Buchert, Adam Mickiewicz University
- Michal Bulant, Masaryk University
- Gabriel Cardona, Universitat de les Illes Balears
- Wouter Castryck, Leuven
- Henri Cohen, Bordeaux
- Francesc Creixell, UPC
- Christian Eder, TU Kaiserslautern
- Burcin Erocal, RISC, JKU - Linz
- Julio Fernández, UPC
- Imma Gálvez, UAB
- Enrique González-Jimenez, Universidad Autónoma de Madrid
- Josep González, UPC
- Jordi Guàrdia, UPC
- Xavier Guitart, UPC
- Amir Hashemi, Isfahan University of Technology (Iran)
- Nikolas Karalis, National Technical University of Athens
- Hamish Ivey-Law, Sydney-Marseille
- David Kohel, Institut de Mathématiques de Luminy
- Joan Carles Lario, UPC
- Offray Vladimir Luna Cárdenas, Javeriana (Colombia)
- David Loeffler, University of Cambridge
- Robert Miller, University of Washington
- Antonio Molina, Addlink Software Científico
- Enric Nart, UAB
- Sebastian Pancratz, University of Oxford
- Clement Pernet
- Joaquim Puig, UPC
- Jordi Quer, UPC
- Anna Río, UPC
- Víctor Rotger, UPC
- Bjarke Roune, University of Aarhus
- Utpal Sarkar, HP (+UPC)
- Diana Savin, Ovidius University (Romania)
- Rainer Schulze-Pillot, Universitaet des Saarlandes
- Mehmet Sengun, University of Duisburg-Essen
- Jaap Spies, Holland
- William Stein, University of Washington
- Emmanuel Thome, INRIA Lorraine
- Andrew Tonks, London Metropolitan University
- Gonzalo Tornaría, Universidad de la República (Uruguay)
- Eulàlia Tramuns, UPC
- Montrserrat Vela, UPC
Preston Wake, McMaster
- Christian Wuthrich, University of Nottingham
- Brian Wyman, Univ of Michigan