Bragg plane

In physics, Bragg's law gives the angles for coherent and incoherent scattering from a crystal lattice.

In physics, Bragg's law gives the angles for coherent and incoherent scattering from a crystal lattice.

Convex lattice polytope

A convex lattice polytope (also called Z-polyhedron or Z-polytope) is a geometric object playing an important role in discrete geometry and combinatorial commutative algebra.

A convex lattice polytope (also called Z-polyhedron or Z-polytope) is a geometric object playing an important role in discrete geometry and combinatorial commutative algebra.

Diamond cubic

The diamond cubic crystal structure is a repeating pattern of 8 atoms that certain materials may adopt as they solidify.

The diamond cubic crystal structure is a repeating pattern of 8 atoms that certain materials may adopt as they solidify.

Divisor summatory function

In number theory, the divisor summatory function is a function that is a sum over the divisor function.

In number theory, the divisor summatory function is a function that is a sum over the divisor function.

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.

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.

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.

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.

Fokker periodicity blocks

Fokker periodicity blocks are a concept in tuning theory used to mathematically relate musical intervals in just intonation to those in equal tuning.

Fokker periodicity blocks are a concept in tuning theory used to mathematically relate musical intervals in just intonation to those in equal tuning.

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.

In mathematics, a fundamental pair of periods is an ordered pair of complex numbers that define a lattice in the complex plane.

Gauss circle problem

In mathematics, the Gauss circle problem is the problem of determining how many integer lattice points there are in a circle centred at the origin and with radius r.

In mathematics, the Gauss circle problem is the problem of determining how many integer lattice points there are in a circle centred at the origin and with radius r.

Gaussian integer

In number theory, a Gaussian integer is a complex number whose real and imaginary part are both integers.

In number theory, a Gaussian integer is a complex number whose real and imaginary part are both integers.

Hexagonal lattice

The hexagonal lattice or equilateral triangular lattice is one of the five 2D lattice types.

The hexagonal lattice or equilateral triangular lattice is one of the five 2D lattice types.

Integer lattice

In mathematics, the n-dimensional integer lattice (or cubic lattice), denoted Z

In mathematics, the n-dimensional integer lattice (or cubic lattice), denoted Z

^{n}, is the lattice in the Euclidean space R^{n}whose lattice points are n'...Integer points in convex polyhedra

Study of integer points in convex polyhedra is motivated by the questions, such as "how many nonnegative integer-valued solutions does a system of linear equations with nonnegative coefficients ...

Study of integer points in convex polyhedra is motivated by the questions, such as "how many nonnegative integer-valued solutions does a system of linear equations with nonnegative coefficients ...

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.

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.

Lattice (group)

In mathematics, especially in geometry and group theory, a lattice in R

In mathematics, especially in geometry and group theory, a lattice in R

^{n}is a discrete subgroup of R^{n}which spans the real vector space R^{n}.Lattice reduction

In mathematics, the goal of lattice basis reduction is given an integer lattice basis as input, to find a basis with short, nearly orthogonal vectors.

In mathematics, the goal of lattice basis reduction is given an integer lattice basis as input, to find a basis with short, nearly orthogonal vectors.

Leech lattice

In mathematics, the Leech lattice is an even unimodular lattice Λ

In mathematics, the Leech lattice is an even unimodular lattice Λ

_{24}in 24-dimensional Euclidean space E^{24}found by.Lenstra-Lenstra-Lovász lattice basis reduction algorithm

The LLL-reduction algorithm (Lenstra–Lenstra–Lovász lattice basis reduction) is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982...

The LLL-reduction algorithm (Lenstra–Lenstra–Lovász lattice basis reduction) is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982...

Lenstra-Lenstra–Lovász lattice basis reduction algorithm

The LLL-reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982, see.

The LLL-reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982, see.

Lenstra–Lenstra–Lovász lattice basis reduction algorithm

The LLL-reduction algorithm (Lenstra–Lenstra–Lovász lattice basis reduction) is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982...

The LLL-reduction algorithm (Lenstra–Lenstra–Lovász lattice basis reduction) is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982...

Meyer set

In mathematics, a harmonious set is a subset of a locally compact abelian group on which every weak character may be uniformly approximated by strong characters.

In mathematics, a harmonious set is a subset of a locally compact abelian group on which every weak character may be uniformly approximated by strong characters.

Niemeier lattice

In mathematics, a Niemeier lattice is one of the 24 positive definite even unimodular lattices of rank 24, which were classified by.

In mathematics, a Niemeier lattice is one of the 24 positive definite even unimodular lattices of rank 24, which were classified by.

No-three-in-line problem

In mathematics, in the area of discrete geometry, the no-three-in-line-problem, introduced by Henry Dudeney in 1917, asks for the maximum number of points that can be placed in the n × n...

In mathematics, in the area of discrete geometry, the no-three-in-line-problem, introduced by Henry Dudeney in 1917, asks for the maximum number of points that can be placed in the n × n...

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 t...

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 t...

Reciprocal lattice

In physics, the reciprocal lattice of a lattice (usually a Bravais lattice) is the lattice in which the Fourier transform of the spatial wavefunction of the original lattice (or direct lattice...

In physics, the reciprocal lattice of a lattice (usually a Bravais lattice) is the lattice in which the Fourier transform of the spatial wavefunction of the original lattice (or direct lattice...

Reeve tetrahedron

In geometry, the Reeve tetrahedron is a polyhedron, named after John Reeve, in R

In geometry, the Reeve tetrahedron is a polyhedron, named after John Reeve, in R

^{3}with vertices at (0, 0, 0), (1, 0, 0), (0, 1, 0) and (1, 1, ...Regular grid

A regular grid is a tessellation of n-dimensional Euclidean space by congruent parallelotopes (e.g.

A regular grid is a tessellation of n-dimensional Euclidean space by congruent parallelotopes (e.g.

Square lattice

In mathematics, the square lattice is a type of lattice in a two-dimensional Euclidean space.

In mathematics, the square lattice is a type of lattice in a two-dimensional Euclidean space.

Unimodular lattice

In mathematics, a unimodular lattice is a lattice of determinant 1 or −1.

In mathematics, a unimodular lattice is a lattice of determinant 1 or −1.