Binary quadratic form — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Also named here as discriminant — the same set of essays touches all of them, so they are one junction rather than several.
How many lattices share a determinant
Area does not decide shape. The number of inequivalent lattices whose metric has a given determinant is a class number, computed by enumerating reduced forms — and checked by reducing every form in a box and counting what comes back distinct.
One way up and p ways down
Every plane lattice has exactly p + 1 sublattices of prime index p. Restrict an integer form to each and the discriminant can do only three things, so the lattices become the vertices of a graph with a definite shape: a ring of lattices at the top, and below it a tree in which every lattice has one way up and p ways down. Whether the ring exists at all is decided by how p factors, which is why the square lattice has two copies of itself at index five and none at index three.
Named alongside it
The objects these essays reach for when they reach for this one.
Class numberDiscriminantEquivalence classHexagonal latticeLattice reductionModular regionModuli spaceNormal formSimilaritySublatticeTheta series