Papers
Topics
Authors
Recent
Search
2000 character limit reached

Companion forms and explicit computation of PGL2 number fields with very little ramification

Published 4 Nov 2016 in math.NT | (1611.01464v2)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.