Perfect lattice

Last updated

In mathematics, a perfect lattice (or perfect form) is a lattice in a Euclidean vector space, that is completely determined by the set S of its minimal vectors in the sense that there is only one positive definite quadratic form taking value 1 at all points of S. Perfect lattices were introduced by Korkine & Zolotareff (1877). A strongly perfect lattice is one whose minimal vectors form a spherical 4-design. This notion was introduced by Venkov (2001).

Voronoi (1908) proved that a lattice is extreme if and only if it is both perfect and eutactic.

The number of perfect lattices in dimensions 1, 2, 3, 4, 5, 6, 7, 8 is given by 1, 1, 1, 2, 3, 7, 33, 10916 (sequence A004026 in the OEIS ). Conway & Sloane (1988) summarize the properties of perfect lattices of dimension up to 7. Sikirić, Schürmann & Vallentin (2007) verified that the list of 10916 perfect lattices in dimension 8 found by Martinet and others is complete. It was proven by Riener (2006) that only 2408 of these 10916 perfect lattices in dimension 8 are actually extreme lattices.

Related Research Articles

<span class="mw-page-title-main">Voronoi diagram</span> Type of plane partition

In mathematics, a Voronoi diagram is a partition of a plane into regions close to each of a given set of objects. In the simplest case, these objects are just finitely many points in the plane. For each seed there is a corresponding region, called a Voronoi cell, consisting of all points of the plane closer to that seed than to any other. The Voronoi diagram of a set of points is dual to that set's Delaunay triangulation.

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 (1967). It may also have been discovered by Ernst Witt in 1940.

23 (twenty-three) is the natural number following 22 and preceding 24.

<span class="mw-page-title-main">Sphere packing</span> An arrangement of non-overlapping spheres within a containing space

In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical size, and the space is usually three-dimensional Euclidean space. However, sphere packing problems can be generalised to consider unequal spheres, spaces of other dimensions or to non-Euclidean spaces such as hyperbolic space.

In geometry, the kissing number of a mathematical space is defined as the greatest number of non-overlapping unit spheres that can be arranged in that space such that they each touch a common unit sphere. For a given sphere packing in a given space, a kissing number can also be defined for each individual sphere as the number of spheres it touches. For a lattice packing the kissing number is the same for every sphere, but for an arbitrary sphere packing the kissing number may vary from one sphere to another.

<span class="mw-page-title-main">Wigner–Seitz cell</span> Primitive cell of crystal lattices with Voronoi decomposition applied

The Wigner–Seitz cell, named after Eugene Wigner and Frederick Seitz, is a primitive cell which has been constructed by applying Voronoi decomposition to a crystal lattice. It is used in the study of crystalline materials in crystallography.

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 volume of any fundamental domain for the lattice be 1.

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 (1973). Venkov (1978) gave a simplified proof of the classification. In the 1970s, Witt (1941) has a sentence mentioning that he found more than 10 such lattices in the 1940s, but gives no further details. One example of a Niemeier lattice is the Leech lattice found in 1967.

Miklós Ajtai is a computer scientist at the IBM Almaden Research Center, United States. In 2003, he received the Knuth Prize for his numerous contributions to the field, including a classic sorting network algorithm, exponential lower bounds, superlinear time-space tradeoffs for branching programs, and other "unique and spectacular" results. He is a member of the U.S. National Academy of Sciences.

<span class="mw-page-title-main">16-cell honeycomb</span>

In four-dimensional Euclidean geometry, the 16-cell honeycomb is one of the three regular space-filling tessellations, represented by Schläfli symbol {3,3,4,3}, and constructed by a 4-dimensional packing of 16-cell facets, three around every face.

The 5-demicube honeycomb is a uniform space-filling tessellation in Euclidean 5-space. It is constructed as an alternation of the regular 5-cube honeycomb.

The 7-demicubic honeycomb, or demihepteractic honeycomb is a uniform space-filling tessellation in Euclidean 7-space. It is constructed as an alternation of the regular 7-cubic honeycomb.

The 8-demicubic honeycomb, or demiocteractic honeycomb is a uniform space-filling tessellation in Euclidean 8-space. It is constructed as an alternation of the regular 8-cubic honeycomb.

In mathematics, the Coxeter–Todd lattice K12, discovered by Coxeter and Todd (1953), is a 12-dimensional even integral lattice of discriminant 36 with no norm-2 vectors. It is the sublattice of the Leech lattice fixed by a certain automorphism of order 3, and is analogous to the Barnes–Wall lattice. The automorphism group of the Coxeter–Todd lattice has order 210·37·5·7=78382080, and there are 756 vectors in this lattice of norm 4 (the shortest nonzero vectors in this lattice).

In mathematics, the Barnes–Wall lattice Λ16, discovered by Eric Stephen Barnes and G. E. (Tim) Wall (Barnes & Wall (1959)), is the 16-dimensional positive-definite even integral lattice of discriminant 28 with no norm-2 vectors. It is the sublattice of the Leech lattice fixed by a certain automorphism of order 2, and is analogous to the Coxeter–Todd lattice.

In mathematics, a eutactic lattice (or eutactic form) is a lattice in Euclidean space whose minimal vectors form a eutactic star. This means they have a set of positive eutactic coefficientsci such that (vv) = Σci(vmi)2 where the sum is over the minimal vectors mi. "Eutactic" is derived from the Greek language, and means "well-situated" or "well-arranged".

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 it is closely related to the Leech lattice Λ, and has the Conway group Co1 at the top of its automorphism group.

In digital signal processing, multidimensional sampling is the process of converting a function of a multidimensional variable into a discrete collection of values of the function measured on a discrete set of points. This article presents the basic result due to Petersen and Middleton on conditions for perfectly reconstructing a wavenumber-limited function from its measurements on a discrete lattice of points. This result, also known as the Petersen–Middleton theorem, is a generalization of the Nyquist–Shannon sampling theorem for sampling one-dimensional band-limited functions to higher-dimensional Euclidean spaces.

In the mathematical fields of numerical analysis and approximation theory, box splines are piecewise polynomial functions of several variables. Box splines are considered as a multivariate generalization of basis splines (B-splines) and are generally used for multivariate approximation/interpolation. Geometrically, a box spline is the shadow (X-ray) of a hypercube projected down to a lower-dimensional space. Box splines and simplex splines are well studied special cases of polyhedral splines which are defined as shadows of general polytopes.

Conway group Co<sub>2</sub>

In the area of modern algebra known as group theory, the Conway groupCo2 is a sporadic simple group of order

References