Leech lattice

From Wikipedia, the free encyclopedia

In mathematics, the Leech lattice is a particular lattice Λ in R24 discovered by John Leech in 1964. (Ernst Witt discovered it in 1940, but did not publish his discovery; see his collected works for details.)

Contents

The Leech lattice Λ is the unique lattice in R24 with the following list of properties:

  • It is unimodular; i.e., it can be generated by the columns of a certain 24×24 matrix with determinant 1.
  • It is even; i.e., the square of the length of any vector in Λ is an even integer.
  • The shortest length of any non-zero vector in Λ is 2.

The last condition means that unit balls centered at the points of Λ do not overlap. Each is tangent to 196,560 neighbors, and this is known to be the largest number of non-overlapping 24-dimensional unit balls that can simultaneously touch a single unit ball (compare with 6 in dimension 2, as the maximum number of pennies which can touch a central penny; see kissing number).

Cohn and Kumar showed that it gives the densest lattice packing of balls in 24-dimensional space. Their results suggest, but do not prove, that this configuration also gives the densest among all packings of balls in 24-dimensional space.

Conway showed that the Leech lattice is isometric to the Dynkin diagram of the reflection group of the 26-dimensional even Lorentzian unimodular lattice II 25,1.

The Leech lattice can be explicitly constructed as the set of vectors of the form 2−3/2(a1, a2, ..., a24) where the ai are integers such that

a_1+a_2+\cdots+a_{24}\equiv 4a_1\equiv 4a_2\equiv\cdots\equiv4a_{24}\pmod{8}

and for each fixed residue class modulo 4, the 24 bit word, whose 1's correspond to the coordinates i such that ai belongs to this residue class, is a word in the binary Golay code.

The Leech lattice can also be constructed as w^\perp/w where w is the norm 0 vector

(0,1,2,3,\dots,22,23,24; 70)

in the 26-dimensional even Lorentzian unimodular lattice II 25,1. The existence of such an integral vector of norm zero relies on the fact that 12 + 22 + ... + 242 is a perfect square (in fact 702); the number 24 is the only integer bigger than 1 with this property.

The Leech lattice is highly symmetrical. Its automorphism group is the double cover of the Conway group Co1; its order is 8,315,553,613,086,720,000. Many other sporadic simple groups can be constructed as the stabilizers of various configurations of vectors in the Leech lattice.

The covering radius of the Leech lattice is \sqrt 2; in other words, if we put a closed ball of this radius around each lattice point, then these just cover Euclidean space. The points at distance at least \sqrt 2 from all lattice points are called the deep holes of the Leech lattice. There are 23 orbits of them under the automorphism group of the Leech lattice, and these orbits are the 23 Niemeier lattices other than the Leech lattice.

The vertex algebra of the conformal field theory describing bosonic string theory, compactified on the 24-dimensional quotient torus R24/Λ and orbifolded by a two-element reflection group, provides an explicit construction of the Griess algebra that has the monster group as its automorphism group. This monster vertex algebra was also used to prove the monstrous moonshine conjectures.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.