Home Research Code Talks Teaching

## High p-Rank

Here you can find implementations of the algorithms we developed in the paper Improved methods for finding imaginary quadratic fields with high n-rank. For a given prime p, these can be used for very rapid generation of discriminants of quadratic number fields with p-rank at least 2. The repository also contains implementations of other search methods, such as the one used in my undergraduate thesis to find the first example of a quadratic number field with a 5-rank equal to 5.