Computational aspects of the diophantine problems
FP4 — Training and Mobility of Researchers
- Duration
- 1996-09-02 → 1998-09-01
- EU contribution
- —
- Participants
- 2
- Scheme
- RGI
Lines connect the coordinator with its partners. CORDIS does not always give exact coordinates for projects before 2014. These points are placed at city or country level.
Project objective
In my thesis, I have studied several diophantine problems and conjectur of Number Theory. In particular, the computational aspect of the abc and the Szpiro conjectures and their applications were extensively explored. I presented several algorithms to test these conjectures leading to the best examples currently known. In future, I propose to continue to study some conjectures and diophantine problems in Number Theory. I wish to go deeper into four of them: 1. The abc conjecture for number fields. I wish to make explicit several parameters for it. 2. Links between minimal discriminant and conductor of hyperelliptic curves. The Szpiro's conjecture was extended to hyperelliptic curves by P. Lockhart. It remains to specify some parameters in this conjecture and to study its consequences. 3. Finding algebraic curves with several rational points. 4. Studying diophantine problems in number fields. This work can be done using the computer algebra system SIMATH, develop by the research group of Prof. H.G. Zimmer at the university of Saarbruecken.
Original text from CORDIS.
Participants
Links
Data: CORDIS, © European Union
