# Category: Lattice points

Korkine–Zolotarev lattice basis reduction algorithm
The Korkine–Zolotarev (KZ) lattice basis reduction algorithm or Hermite-Korkine–Zolotarev (HKZ) algorithm is a lattice reduction algorithm. For lattices in it yields a lattice basis with orthogonality
Fundamental pair of periods
In mathematics, a fundamental pair of periods is an ordered pair of complex numbers that define a lattice in the complex plane. This type of lattice is the underlying object with which elliptic functi
Euclid's orchard
In mathematics, informally speaking, Euclid's orchard is an array of one-dimensional "trees" of unit height planted at the lattice points in one quadrant of a square lattice. More formally, Euclid's o
Divisor summatory function
In number theory, the divisor summatory function is a function that is a sum over the divisor function. It frequently occurs in the study of the asymptotic behaviour of the Riemann zeta function. The
Reciprocal lattice
In physics, the reciprocal lattice represents the Fourier transform of another lattice (group) (usually a Bravais lattice). In normal usage, the initial lattice (whose transform is represented by the
Lattice (group)
In geometry and group theory, a lattice in the real coordinate space is an infinite set of points in this space with the properties that coordinate wise addition or subtraction of two points in the la
Bragg plane
In physics, a Bragg plane is a plane in reciprocal space which bisects a reciprocal lattice vector, , at right angles. The Bragg plane is defined as part of the Von Laue condition for diffraction peak
Meyer set
In mathematics, a Meyer set or almost lattice is a set relatively dense X of points in the Euclidean plane or a higher-dimensional Euclidean space such that its Minkowski difference with itself is uni
Unimodular lattice
In geometry and mathematical group theory, a unimodular lattice is an integral lattice of determinant 1 or −1. For a lattice in n-dimensional Euclidean space, this is equivalent to requiring that the
Integer points in convex polyhedra
The study of integer points in convex polyhedra is motivated by questions such as "how many nonnegative integer-valued solutions does a system of linear equations with nonnegative coefficients have" o
Hexagonal lattice
The hexagonal lattice or triangular lattice is one of the five two-dimensional Bravais lattice types. The symmetry category of the lattice is wallpaper group p6m. The primitive translation vectors of
E8 lattice
In mathematics, the E8 lattice is a special lattice in R8. It can be characterized as the unique positive-definite, even, unimodular lattice of rank 8. The name derives from the fact that it is the ro
Kemnitz's conjecture
In additive number theory, Kemnitz's conjecture states that every set of lattice points in the plane has a large subset whose centroid is also a lattice point. It was proved independently in the autum
Regular grid
A regular grid is a tessellation of n-dimensional Euclidean space by congruent parallelotopes (e.g. bricks). Its opposite is irregular grid. Grids of this type appear on graph paper and may be used in
No-three-in-line problem
The no-three-in-line problem in discrete geometry asks how many points can be placed in the grid so that no three points lie on the same line. This number is at most , because points in a grid would i
Reeve tetrahedron
In geometry, the Reeve tetrahedron is a polyhedron, in three-dimensional space with vertices at (0, 0, 0), (1, 0, 0), (0, 1, 0) and (1, 1, r) where r is a positive integer. It is named after , who use
Computing the Continuous Discretely
Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra is an undergraduate-level textbook in geometry, on the interplay between the volume of convex polytopes and the number of la
Bravais lattice
In geometry and crystallography, a Bravais lattice, named after Auguste Bravais, is an infinite array of discrete points generated by a set of discrete translation operations described in three dimens
Square lattice
In mathematics, the square lattice is a type of lattice in a two-dimensional Euclidean space. It is the two-dimensional version of the integer lattice, denoted as . It is one of the five types of two-
Poisson summation formula
In mathematics, the Poisson summation formula is an equation that relates the Fourier series coefficients of the periodic summation of a function to values of the function's continuous Fourier transfo
Dot planimeter
A dot planimeter is a device used in planimetrics for estimating the area of a shape, consisting of a transparent sheet containing a square grid of dots. To estimate the area of a shape, the sheet is
Leech lattice
In mathematics, the Leech lattice is an even unimodular lattice Λ24 in 24-dimensional Euclidean space, which is one of the best models for the kissing number problem. It was discovered by John Leech.
Gauss circle problem
In mathematics, the Gauss circle problem is the problem of determining how many integer lattice points there are in a circle centered at the origin and with radius . This number is approximated by the
Diamond cubic
The diamond cubic crystal structure is a repeating pattern of 8 atoms that certain materials may adopt as they solidify. While the first known example was diamond, other elements in group 14 also adop
Gaussian integer
In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an
II25,1
In mathematics, II25,1 is the even 26-dimensional Lorentzian unimodular lattice. It has several unusual properties, arising from Conway's discovery that it has a norm zero Weyl vector. In particular i
Eisenstein integer
In mathematics, the Eisenstein integers (named after Gotthold Eisenstein), occasionally also known as Eulerian integers (after Leonhard Euler), are the complex numbers of the form where a and b are in
Fokker periodicity block
Fokker periodicity blocks are a concept in tuning theory used to mathematically relate musical intervals in just intonation to those in equal tuning. They are named after Adriaan Daniël Fokker. These
Lenstra–Lenstra–Lovász lattice basis reduction algorithm
The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. Given a basis
Pick's theorem
In geometry, Pick's theorem provides a formula for the area of a simple polygon with integer vertex coordinates, in terms of the number of integer points within it and on its boundary. The result was
Rectangular lattice
The rectangular lattice and rhombic lattice (or centered rectangular lattice) constitute two of the five two-dimensional Bravais lattice types. The symmetry categories of these lattices are wallpaper
Integer lattice
In mathematics, the n-dimensional integer lattice (or cubic lattice), denoted , is the lattice in the Euclidean space whose lattice points are n-tuples of integers. The two-dimensional integer lattice
Lattice reduction
In mathematics, the goal of lattice basis reduction is to find a basis with short, nearly orthogonal vectors when given an integer lattice basis as input. This is realized using different algorithms,
Oblique lattice
The oblique lattice is one of the five two-dimensional Bravais lattice types. The symmetry category of the lattice is wallpaper group p2. The primitive translation vectors of the oblique lattice form
Double lattice
In mathematics, especially in geometry, a double lattice in ℝn is a discrete subgroup of the group of Euclidean motions that consists only of translations and point reflections and such that the subgr
Ehrhart polynomial
In mathematics, an integral polytope has an associated Ehrhart polynomial that encodes the relationship between the volume of a polytope and the number of integer points the polytope contains. The the
Niemeier lattice
In mathematics, a Niemeier lattice is one of the 24 positive definite even unimodular lattices of rank 24,which were classified by Hans-Volker Niemeier. gave a simplified proof of the classification.