Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Number theory --- Partitions (Mathematics) --- Pavage et remplissage (Géométrie combinatoire) --- Théorie des nombres --- Number Theory --- 51 <031> --- 519.1 --- 511 --- Number study --- Numbers, Theory of --- Algebra --- Mathematics--Encyclopedieën. Lexica --- Combinatorics. Graph theory --- Number theory. --- Partitions (Mathematics). --- 511 Number theory --- 519.1 Combinatorics. Graph theory --- 51 <031> Mathematics--Encyclopedieën. Lexica --- Pavage et remplissage (Géométrie combinatoire) --- Théorie des nombres --- Analyse combinatoire

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

We now apply the algorithm above to find the 121 orbits of norm -2 vectors from the (known) nann 0 vectors, and then apply it again to find the 665 orbits of nann -4 vectors from the vectors of nann 0 and -2. The neighbors of a strictly 24 dimensional odd unimodular lattice can be found as follows. If a norm -4 vector v E II . corresponds to the sum 25 1 of a strictly 24 dimensional odd unimodular lattice A and a !-dimensional lattice, then there are exactly two nonn-0 vectors of ll25,1 having inner product -2 with v, and these nann 0 vectors correspond to the two even neighbors of A. The enumeration of the odd 24-dimensional lattices. Figure 17.1 shows the neighborhood graph for the Niemeier lattices, which has a node for each Niemeier lattice. If A and B are neighboring Niemeier lattices, there are three integral lattices containing A n B, namely A, B, and an odd unimodular lattice C (cf. [Kne4]). An edge is drawn between nodes A and B in Fig. 17.1 for each strictly 24-dimensional unimodular lattice arising in this way. Thus there is a one-to-one correspondence between the strictly 24-dimensional odd unimodular lattices and the edges of our neighborhood graph. The 156 lattices are shown in Table 17 .I. Figure I 7. I also shows the corresponding graphs for dimensions 8 and 16.

Combinatorial packing and covering --- Eindige groepen --- Finite groups --- Groepen [Eindige ] --- Groupes finis --- Groups [Finite ] --- Lattice theory --- Pavage et remplissage (Géométrie combinatoire) --- Roostertheorie --- Sfeer --- Sphere --- Sphère --- Treillis [Theorie des ] --- Finite groups. --- Lattice theory. --- Sphere packings. --- 519.1 --- 512.54 --- Sphere packings --- Combinatorics. Graph theory --- Groups. Group theory --- Packing of spheres --- Packings of spheres --- Lattices (Mathematics) --- Space lattice (Mathematics) --- Structural analysis (Mathematics) --- Algebra, Abstract --- Algebra, Boolean --- Group theory --- Set theory --- Topology --- Transformations (Mathematics) --- Crystallography, Mathematical --- Groups, Finite --- Modules (Algebra) --- 512.54 Groups. Group theory --- 519.1 Combinatorics. Graph theory --- Applied mathematics. --- Engineering mathematics. --- Group theory. --- Computational intelligence. --- Chemometrics. --- Applications of Mathematics. --- Group Theory and Generalizations. --- Computational Intelligence. --- Math. Applications in Chemistry. --- Chemistry, Analytic --- Analytical chemistry --- Chemistry --- Intelligence, Computational --- Artificial intelligence --- Soft computing --- Groups, Theory of --- Substitutions (Mathematics) --- Algebra --- Engineering --- Engineering analysis --- Mathematical analysis --- Mathematics --- Measurement --- Statistical methods