Explicit Methods for the Darmon Programme

Informations projet

ExplicitDarmonProg

N° de convention de subvention: 655662

DOI

10.3030/655662

Projet clôturé le 10 Mai 2017

Date de signature de la CE 24 Mars 2015

Date de début 1 Septembre 2015

Date de fin 30 Septembre 2017

Financé au titre de

• EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions

Coût total

€ 195 454,80

Contribution de l’UE

€ 195 454,80

Coordonné par

UNIVERSITY OF WARWICK
United Kingdom

Periodic Reporting for period 1 - ExplicitDarmonProg (Explicit Methods for the Darmon Programme)

Période du rapport: 2015-09-01 au 2017-08-31

Résumé du contexte et des objectifs généraux du projet

Elliptic curves are mathematical objects that have been studied since Diophantus in the third century AD. They are now of vital importance in cryptography and cyber-security and are used for securing online bank transactions. In the 1960s, Birch and Swinnerton-Dyer performed massive experimental computations on elliptic curves using one of the earliest available computers (EDSAC II in Cambridge). On the basis of these computations they formulated what is now known as the Birch and Swinnerton-Dyer conjecture, one of seven very famous open problems in Mathematics, for which there is a $1M prize for resolving. All special cases of the Birch and Swinnerton-Dyer conjecture that have been proved rely on a construction due to German mathematician Heegner. In 2000, Canadian mathematician Darmon proposed a wide-ranging generalization of the Heegner construction, which has led to the concepts of Darmon points and cycles, and also to new proofs of special cases of the Birch and Swinnerton-Dyer conjecture. This project is concerned with Darmon points and cycles from an algorithmic point-of-view: it aims to develop constructions and software for these objects.

Travail effectué depuis le début du projet jusqu’à la fin de la période considérée dans le rapport et principaux résultats atteints jusqu’à présent

"In the first year of the fellowship, the researcher has completed work on the first research project of the original proposal ""Higher Degree Darmon Points"". This consisted of three work packages: ""Describe higher degree overconvergent cohomology"", ""Devise algorithms to compute Darmon homology cycles"" and ""Compute the integration pairing"", and resulted in two publications and two submitted manuscripts, plus two software packages that are freely available to other researchers."

Progrès au-delà de l’état des connaissances et impact potentiel prévu (y compris l’impact socio-économique et les conséquences sociétales plus larges du projet jusqu’à présent)

The project has yielded the first ever algorithms and software for both Leezarbs and exotic Darmon points. This is expected to provide constructions of points in all rank 1 situations, and give a better understanding Heenger points.

Concepts prevalent in the subject of Darmon points