NumberFields@home Project Description

Fields are important mathematical constructs that have far reaching applications to many branches of mathematics. Many people are familiar with the fields of rational numbers, real numbers, and complex numbers. The fields we are concerned with in this project are number fields: subsets of the complex numbers which contain the root of a given polynomial and are minimal for then being closed under addition, subtraction, multiplication, and division (except for division by 0). In particular, we are interested in imprimitive degree 10 fields (called decic fields), which correspond to certain degree 10 polynomials. Computing lower degree fields requires less processing power and have been more extensively tabulated. The degree 10 case is the first case requiring a massively parallel solution, and hence the reason for implementing a BOINC project.

One way to categorize fields is by the primes that ramify in them. For a given set of primes, the number of fields ramified at those primes is finite. The primary goal of the project is to find this finite set of fields for various sets of primes. Since the number of combinations of primes is unlimited, the project will remain open-ended for the forseeable future.

Another way to categorize fields is by their discriminant, which is an important
invariant for a field. Given a fixed bound \(B\), there are only a finite
number of fields whose discriminant is less than this bound. A secondary goal
of the project is to determine the finite set of "minimum discriminant"
imprimitive decic fields for the bound \( B=1.2 \times 10^{11} \). We chose
this bound for it's potential to find more fields while keeping the computational
load manageable.

For example, in studying automorphic forms over \( \bbQ(i) \), a researcher wanted to show that there were no automorphic forms of a certain type. The problem was recast into a statement about number fields, summarized by the following statement:

There is no quintic extension \( L \) of \( \bbQ(i) \) satisfying:Using the table of decic fields over \( \bbQ(i) \), this statement was shown to be true. (Note that the project is still completing the search over \( \bbQ(i) \), but the discriminant bound above was small enough that the earlier part of the search was sufficient to determine the truth of the statement.)

- \( \Gal( L^g/\bbQ(i))=A_5 \) (where \(L^g\) is the Galois closure of \(L\) ),
- \( L \) is unramified outside of \( S=\{2,5\} \), and
- \( d_L \) divides \( 2^{14}5^{15} \).

Recently, researchers have been factoring the Galois group of the extension. At present, there is very little data in degree 10, and imprimitive fields produce a large number of different Galois groups.

One can also ask about asymptotics based on the set of ramifying primes. There is even less data currently available for investigating questions of this sort.

Before one can seriously consider asymptotics, it is useful to know
where the first examples lie. This project has helped establish the
first examples of imprimitive decic number fields with certain Galois
groups. One can also consider "first examples" from another
perspective, namely by the Galois root discriminant (GRD) of the
field. We compute the GRD of the fields found here, looking for fields
with especially small GRD. Some results for low GRD fields can be found
here.

Finite extension fields are represented by polynomials (i.e. they are of the form \( \bbQ(\alpha) \) where \(\alpha\) is the root of a polynomial). Bounds on the field discriminant give rise to bounds on the polynomial coefficients, so there are a finite number of possible polynomials that can represent the fields we are searching for. At the most basic level, the algorithm searches over this finite set of polynomials, checking whether or not a polynomial can represent a field with the desired discriminant and ramification properties. At a finer level, the algorithm uses some tricky theoretical arguments to reduce the polynomial search space. In addition, the targetted ramification structure gives rise to congruence relations on the polynomial coefficients, which further reduces the search space. Anybody interested in the finer details of the algorithm is encouraged to look through my dissertation.