# Put attached lattice.py and modular.py beside this script; use SageMath with numberdb.
import numberdb.sage as numberdb
from lattice import gram, quotient
def absolute_discriminant(n, d):
if n < 2 or n % 2 or d < 3:
raise ValueError("need even n>=2 and integer d>=3")
planes, G = gram(n, d)
J, H, C, K = quotient(G)
return abs(K.det())
absolute_discriminant(2, 4) # 64
# Default stored selection: every (2,d) with 3<=d<=14,
# and every (4,d) with 3<=d<=5. Larger inputs can be expensive.
The attached generator multiplies the exact elementary divisors transcribed from [1], Table 1. All 15 lattices were also recomputed from their complete plane intersections with exact integer and rational arithmetic. Integral quotient certificates record $G=CKC^{\mathsf T}$, with the rows of $C$ spanning $\mathbb Z^\rho$; this excludes a proper finite-index sublattice from a merely rational selection of planes.
A separate checker uses cyclotomic equation-matrix ranks for every relative matching and phase configuration, verifies the complete Gram matrices and integral quotient certificates, and compares every invariant factor with the source. Large integer Smith reductions are replaced by exact Schur complements modulo prime powers, with checked unit-block inverses and valuation sums matching the exact determinant; this method is controlled against native Smith results. Exact characteristic polynomials check the signatures. Known-answer and deliberately invalid controls are retained. The certificates concern the plane span; no independent integral embedding into the full Hodge lattice or complete plane-period vectors in Pham coordinates are asserted.