Lower bounds for GL2(F) number fields
Abstract
Let Fn(X;G) denote the set of number fields of degree n with absolute discriminant no larger than X and Galois group G. This set is known to be finite for any finite permutation group G and X ≥ 1. In this paper, we give a lower bound for the cases G=GL2(F), \; PGL2(F) for primes ≥ 13. We also provide a method to compute lower bounds for any permutation representations of these groups.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.