A Euclidean lattice is a discrete subgroup spanning the ambient vector space. Its covolume is the volume of a fundamental parallelepiped.
For an integer basis of a Euclidean lattice, the algorithm uses integer column operations and swaps to obtain a size-reduced basis with Gram-Schmidt coefficients and the condition . It preserves the lattice and exposes short vectors and near-relations. It is useful for improving proven Diophantine bounds by encoding scaled logarithms in integer coordinates. A certified lower bound for every nonzero lattice vector is : in a nonzero integer linear combination, project onto the last nonzero Gram-Schmidt direction. Better-reduced bases improve this lower bound. Rounding and logarithm errors must still be bounded before turning it into a certified lower bound for a logarithmic form.
A complex lattice is a discrete rank-two subgroup of the complex plane, generated by two real-linearly independent periods. An oriented basis can be chosen with . Scaling by then gives for a point in the complex upper half-plane.
Two complex lattices are homothetic when multiplication by one nonzero complex number takes one onto the other. Changes between oriented integral bases have determinant one, so normalized period ratios classify these classes by . The lattice Eisenstein sums scale as .
For the skew matrix , both Euclidean lattices reduce to the tetracode modulo . A reflection depending on the reduction coset matches their vectors coordinatewise in absolute value. Their weighted length spectra agree for all positive diagonal axis weights. Rationally independent weights force any possible linear isometry to be a coordinate sign change; the code then forces an overall sign, which does not identify the two lattices.
Choose positive axis weights linearly independent over the rationals, and suppose both integer Euclidean lattices contain for some positive integer . A length-preserving linear map sends each to an integer vector with exactly that absolute-coordinate pattern, by the displayed implication. Thus the map must be a diagonal sign change. For the four-coordinate tetracode, preserving the code forces all four signs to agree, because each of its four nonzero projective words has support on a different triple of coordinates. A global sign cannot exchange the two odd-vector parity conditions, proving nonisometry for these weights.
Add respectively the conditions and to the displayed common conditions. These define the two integer Euclidean lattices underlying the tetracode length-isospectral lattice construction. They coincide on their all-even vectors and differ on all-odd vectors. Reflecting a coordinate divisible by three preserves the code condition; on odd vectors it changes the coordinate sum by two modulo four, while on even vectors both conditions remain satisfied. This yields the coordinate reflection bijection for tetracode lattices.
For the tetracode length-isospectral lattice construction , choose the first coordinate divisible by three and reverse its sign. Such a coordinate always exists because each nonzero tetracode word has one zero coordinate. The reflection preserves the reduction modulo three and switches the two lattice membership conditions modulo four. It is an involution between and preserving every absolute coordinate, so arbitrary positive diagonal weights preserve equality of their vector-length multisets.
The covolume of a full Euclidean lattice is the Lebesgue measure of a fundamental parallelepiped in its ambient inner product space. In orthonormal coordinates it is for a lattice basis matrix . Scaling the lattice by multiplies the covolume by ; the dual lattice has reciprocal covolume.
In a rank-two Euclidean lattice, a shortest nonzero vector and a shortest vector form a basis. The shortest vector is primitive. If the vertical coordinate of has index in the projection lattice, a vector with smaller positive vertical coordinate can be reduced horizontally to length squared at most , a contradiction. This lemma need not hold in higher rank.
For a full-rank Euclidean lattice of covolume in , bounded fundamental cells compare lattice points in a radius- ball with the volumes of balls of radii . Hence . A lattice norm multiset therefore determines the covolume, which is useful for the spectrum of a flat torus.
The dual lattice of a full-rank Euclidean lattice isHere is the Euclidean inner product. If the columns of an invertible matrix form a basis of , thenIndeed, belongs to the dual lattice exactly when ; denotes the transpose of the matrix inverse. The reciprocal covolume follows by taking the determinant. With the Fourier transform kernel , these are precisely the frequencies of the characters of a real torus: translating by any leaves unchanged. In one dimension, for : increasing the spacing in physical space decreases the spacing in frequency space.
Every continuous group homomorphism is for a unique in the dual lattice. Compactness forces unit modulus, and lifting the character to the simply connected cover makes its phase a real linear functional. These characters are the frequencies of torus Fourier series.
Articles by others on the same topic
There are currently no matching articles.