Computing transcendence and linear relations of 1-periods

Abstract: I will sketch a modestly practical algorithm to compute all linear relations with algebraic coefficients between any given finite set of 1-periods. As a special case, we can algorithmically decide the transcendence of 1-periods. This is based on the "qualitative description" of these relations by Huber and Wüstholz via 1-motives. We combine their result with the recent work on computing the endomorphism ring of abelian varieties. This is a work in progress with Jöel Ouaknine (MPI SWS) and James Worrell (Oxford).

algebraic geometrynumber theory

Audience: researchers in the topic

MIT number theory seminar

Series comments: To receive announcements by email, add yourself to the nt mailing list.

Past semesters