Please use this identifier to cite or link to this item:
|Title:||Unconditional Class Group Tabulation to 2⁴⁰|
|Abstract:||In this thesis, we aim to tabulate the class groups of binary quadratic forms for all fundamental discriminants D < 0 satisfying |D| < 2⁴⁰. Our computations are performed in several stages. We first multiply large polynomials in order to produce class numbers h(D) for D != 1 (mod 8). This stage is followed by the resolution of class groups Cl(D) with the Buchmann-Jacobson-Teske algorithm, which can be significantly accelerated when the class numbers are known. In order to determine Cl(D) for D = 1 (mod 8), we use this algorithm in conduction with Bach's conditional averaging method and the Eichler-Selberg trace formula, required for unconditional verification. Our novel class group tabulation method allowed us to gather unconditional numerical evidence in support of certain hypotheses, such as the Littlewood's bounds on L(1,x) and the Cohen-Lenstra heuristics.|
|Appears in Collections:||Electronic Theses|
Files in This Item:
|ucalgary_2014_mosunov_anton.pdf||1 MB||Adobe PDF||View/Open|
Items in The Vault are protected by copyright, with all rights reserved, unless otherwise indicated.