Counting points on Calabi-Yau threefolds - Some computational aspects

被引：0

作者：

Hulek, K ^{[1
]}

Spandaw, J ^{[1
]}

机构：

[1] Leibniz Univ Hannover, Hannover, Germany

来源：

APPLICATIONS OF ALGEBRAIC GEOMETRY TO CODING THEORY, PHYSICS AND COMPUTATION | 2001年 / 36卷

关键词：

Calabi-Yau varieties; L-function; modularity; diophantine equations; modular forms;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We discuss a number of examples of rigid Calabi-Yau varieties for which one can prove modularity. In this situation the number N-p of F-p-rational points of the Calabi-Yau is (via the Lefschetz fixed point formula) related to the Fourier coefficient a(p) of some modular form. In all cases which we discuss it turns out that it is much faster to compute ap than N-p.

引用

页码：195 / 205

页数：11