2016/11/04 by Mascot, Nicolas
#11F11 #11F30 (Secondary) #11F80 #11R21 #11Y40 (Primary) #FOS: Mathematics #Number Theory (math.NT)
paper · doi:10.48550/arxiv.1611.01464
In previous works, we described algorithms to compute the number field cut out by the mod ell representation attached to a modular form of level N=1. In this article, we explain how these algorithms can be generalised to forms of higher level N. As an application, we compute the Galois representations attached to a few forms which are supersingular or admit a companion mod ell with ell=13 (and soon ell=41), and we obtain previously unknown number fields of degree ell+1 whose Galois closure has Galois group PGL(2,ell) and a root discriminant that is so small that it beats records for such number fields. Finally, we give a formula to predict the discriminant of the fields obtained by this method, and we use it to find other interesting examples, which are unfortunately out of our computational reach.