Python implementation of Class Group algorithms from Cohen (GTM 138)
-
Updated
May 30, 2022 - Python
#
imaginary-quadratic-fields
Here are 4 public repositories matching this topic...
N = n₁ + n₂ with n₁, n₂ sums of two squares (or values of any class number one form) and Ω(n₁n₂) ≤ 11, max Ω(nᵢ) ≤ 8: paper, linear vector sieve with switching and Richert weights, interval-arithmetic certification.
python latex mathematics interval-arithmetic number-theory analytic-number-theory computer-assisted-proofs imaginary-quadratic-fields sieve-methods additive-number-theory binary-quadratic-forms sums-of-two-squares almost-primes
-
Updated
Oct 4, 2026 - Python
Primes p ≤ N with N − p an almost prime sum of two squares (Ω ≤ 9): paper, semi-linear vector sieve with Richert weights and switching, and an interval-arithmetic certification script.
prime-numbers interval-arithmetic goldbach-conjecture analytic-number-theory computer-assisted-proofs imaginary-quadratic-fields sieve-methods binary-quadratic-forms sums-of-two-squares almost-primes
-
Updated
Oct 4, 2026 - TeX
A low-level C implementation of the algorithms to compute class polynomials. Mirrored from Andrew Sutherland's MIT page with additional functionality bolted on.
c cryptography cmake parallel-computing mathematics arbitrary-precision finite-fields elliptic-curves gmp number-theory chinese-remainder-theorem isogeny computational-number-theory complex-multiplication hilbert-class-polynomial algebraic-number-theory class-field-theory imaginary-quadratic-fields class-polynomials modular-polynomials
-
Updated
Apr 3, 2026 - C
Add this topic to your repo
To associate your repository with the imaginary-quadratic-fields topic, visit your repo's landing page and select "manage topics."