Integer lattice

Integer lattice

In mathematics, the n-dimensional integer lattice (or cubic lattice), denoted Zn, is the lattice in the Euclidean space Rn whose lattice points are n-tuples of integers. The two-dimensional integer lattice is also called the square lattice, or grid lattice. Zn is the simplest example of a root lattice. The integer lattice is an odd unimodular lattice.

Contents

Automorphism group

The automorphism group (or group of congruences) of the integer lattice consists of all permutations and sign changes of the coordinates, and is of order 2n n!. As a matrix group it is given by the set of all n×n signed permutation matrices. This group is isomorphic to the semidirect product

(\mathbb Z_2)^n \rtimes S_n

where the symmetric group Sn acts on (Z2)n by permutation (this is a classic example of a wreath product).

For the square lattice, this is the group of the square, or the dihedral group of order 8; for the three dimensional cubic lattice, we get the group of the cube, or octahedral group, of order 48.

Diophantine geometry

In the study of Diophantine geometry, the square lattice of points with integer coordinates is often referred to as the Diophantine plane. In mathematical terms, the Diophantine plane is the Cartesian product \scriptstyle\mathbb{Z}\times\mathbb{Z} of the ring of all integers \scriptstyle\mathbb{Z}. The study of Diophantine figures focuses on the selection of nodes in the Diophantine plane such that all pairwise distances are integer.

Coarse geometry

In coarse geometry, the integer lattice is coarsely equivalent to Euclidean space.

See also


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Lattice based cryptography — is the generic term for asymmetric cryptographic primitives based on lattice. HistoryLattice have first been discovered by mathematicans Lagrange and Gauss. Lattice have been used laterly in computer algorithms and in cryptanalysis. In 1996 Atjai …   Wikipedia

  • 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. This is realized using different algorithms, whose running time is usually at least exponential …   Wikipedia

  • Integer — This article is about the mathematical concept. For integers in computer science, see Integer (computer science). Symbol often used to denote the set of integers The integers (from the Latin integer, literally untouched , hence whole : the word… …   Wikipedia

  • Lattice (group) — A lattice in the Euclidean plane. In mathematics, especially in geometry and group theory, a lattice in Rn is a discrete subgroup of Rn which spans the real vector space Rn. Every lattice in Rn …   Wikipedia

  • Lattice problem — In computer science, lattice problems are a class of optimization problems on lattices. The conjectured intractability of such problems is central to construction of secure lattice based cryptosystems. For applications in such cryptosystems,… …   Wikipedia

  • Lattice (discrete subgroup) — In Lie theory and related areas of mathematics, a lattice in a locally compact topological group is a discrete subgroup with the property that the quotient space has finite invariant measure. In the special case of subgroups of R n , this amounts …   Wikipedia

  • Lattice plane — In crystallography, a lattice plane of a given Bravais lattice is a plane (or family of parallel planes) whose intersections with the lattice (or any crystalline structure of that lattice) are periodic (i.e. are described by 2d Bravais lattices) …   Wikipedia

  • Lattice graph — The terms lattice graph, mesh graph, or grid graph refer to a number of categories of graphs whose drawing corresponds to some grid/mesh/lattice, i.e., its vertices correspond to the nodes of the mesh and its edges correspond to the ties between… …   Wikipedia

  • Leech lattice — In mathematics, the Leech lattice is an even unimodular lattice Λ24 in 24 dimensional Euclidean space E24 found by John Leech (1967). Contents 1 History 2 Characterization 3 Properties …   Wikipedia

  • Gaussian integer — In number theory, a Gaussian integer is a complex number whose real and imaginary part are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as Z[i]. The… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”