Computing the level of a modular rigid Calabi-Yau threefold
Luis Dieulefait
Abstract
In a previous article (a joint work with J. Manoharmayum) the modularity of a large class of rigid Calabi-Yau threefolds was established. To make that result more explicit, we recall (and re-prove) a result of Serre giving a bound for the conductor of an "integral" 2-dimensional compatible family of Galois representations and apply this result to give an algorithm that determines the level of a modular rigid Calabi-Yau threefold. We apply the algorithm to three examples.
Create a lesson
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan