Class Group and Unit Computation: the Computational Problem
Why class group and unit computation are a single problem, what the combined algorithm produces, and how the results are verified.
Every page in the KEVOS library tagged Regulator. 7 pages.
Why class group and unit computation are a single problem, what the combined algorithm produces, and how the results are verified.
Reduction of indefinite binary forms, the cycle of reduced forms in each class, and how the cycle encodes the regulator.
Extracting fundamental units and the regulator from the kernel of the relation matrix, and confirming the unit system is fundamental.
The four fundamental computational problems for a number field, their dependencies, and what counts as a complete answer to each.
Computing the fundamental unit of a real quadratic field by continued fractions, its connection to the Pell equation, and its size.
The regulator as the covolume of the unit lattice, its computation, and the precision and verification it demands.
Regulators and fundamental units of real quadratic fields, the continued fraction algorithm, the exponential cost problem, and Shanks's infrastructure with the distance function.