Unimodular lattices with a complete root system
Let \(\Lambda\) be a lattice in \(\mathbb{R}^ n\) with root system \(\Lambda_ 2\). Then \(\Lambda_ 2\) is called complete if \(\Lambda_ 2\) generates \(\mathbb{R}^ n\) as an \(\mathbb{R}\)-vector space. The author gives a classification of even unimodular lattices of dimension 32 with complete root system. If \(\Lambda_ 2\) contains an orthogonal basis of \(\mathbb{R}^ n\), then the classification of lattices is equivalent to the classification of doubly-even self-dual binary codes of length 32, which was accomplished by \textit{J. H. Conway} and \textit{V. Pless} [J. Comb. Theory, Ser. A 28, 26-53 (1980; Zbl 0439.94011)]. The problem of classifying lattices without orthogonal bases remains. There are exactly 57 such lattices which are indecomposable. They are all determined by their root system. As in the classification of codes in the above cited paper of Conway and Pless the author needed the help of a computer to get his result.
- On even unimodular positive definite quadratic lattices of rank 32
- Nonrigidity degrees of root lattices and their duals
- Construction of new extremal unimodular lattices
- Classification of positive definite lattices
- Pieces of eight: semiselfdual lattices and a new foundation for the theory of Conway and Mathieu groups
- New meromorphic CFTs from cosets
- scientific article; zbMATH DE number 1325582 (Why is no real title available?)
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- A detailed study of the relationship between some of the root lattices and the coding theory
- scientific article; zbMATH DE number 2140369 (Why is no real title available?)
- scientific article; zbMATH DE number 749579 (Why is no real title available?)
- scientific article; zbMATH DE number 3797838 (Why is no real title available?)
- A mass formula for unimodular lattices with no roots
- Meromorphic cosets and the classification of three-character CFT
- Modular differential equations with movable poles and admissible RCFT characters
- Classifying three-character RCFTs with Wronskian index equalling 3 or 4
- Rational CFT with three characters: the quasi-character approach
This page was built for publication: Unimodular lattices with a complete root system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1332383)
