Computing isometries of lattices (Q1369794)

The authors discuss ideas for an algorithm that calculates the automorphism group of a Euclidean lattice, extending a previous algorithm of \textit{W. Plesken} and \textit{M. Pohst} [Math. Comput. 45, 209-221 (1985; Zbl 0581.10014)]. They present a new method to compute partial automorphisms, speeding up the process for lattices having little symmetry. The use of Bacher polynomials and backtracking are discussed, along with some of their advantages and disadvantages. A brief account of how to choose generators follows. Numerous examples demonstrating strengths and weaknesses of the various techniques are included. Among them are the Leech lattice, the Barnes-Wall lattice and \(Q_{32}\) [see \textit{H. G. Quebbemann}, J. Algebra 105, 443-450 (1987; Zbl 0609.10026)]. They also include modifications of the algorithm to find, e.g., isometries of lattices.