Classification of integral lattices with large class number

From MaRDI portal





The authors have developed a program that automatically enumerates the classes in a given genus of positive definite integral lattices, allowing dimensions up to about 16 and class numbers of some hundreds. The basic way of producing representatives for all classes is Kneser's neighbour method, reviewed at the beginning. A procedure giving a basis of the neighbour lattice is described in detail. Iteration of the process becomes effective by generating neighbours of a lattice only up to the action of its automorphism group. The fast methods needed for computing these groups and testing isometry are due to \textit{W. Plesken} and \textit{M. Pohst} [Math. Comput. 45, 209-221 (1985; Zbl 0581.10014)] and \textit{W. Plesken} and \textit{B. Souvignier} [J. Symb. Comput. 24, 327-334 (1997; Zbl 0882.11042)]. In the second half of the paper, the authors report on explicit results obtained by their program for several genera of so-called modular lattices. In particular, determination of all 395 classes proves the non-existence of a 12-dimensional level-7 extremal lattice (which one had expected to exist in analogy with the extremal even unimodular lattices \(P_{48}\) and others). This work has been continued by \textit{R. Scharlau} and \textit{R. Schulze-Pillot} [Extremal lattices, in: Algorithmic algebra and number theory, Heidelberg 1997, 139-170 (1999)].




Cited in
(29)








This page was built for publication: Classification of integral lattices with large class number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4383191)