Computing isometries of lattices

被引：65

作者：

Plesken, W

Souvignier, B

机构：

[1] Lehrstuhl B für Mathematik, Rheinisch-Westfalische TH Aachen, D-52062 Aachen

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 1997年 / 24卷 / 3-4期

关键词：

D O I：

10.1006/jsco.1996.0130

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present the main ideas for an algorithm to calculate the group of automorphisms of a Euclidean lattice. This algorithm can be applied to related problems, e.g. to compute Bravais groups, to calculate automorphisms of lattices over number fields or, in a slightly modified version, to find isometries between lattices. An implementation of the algorithm by the second author has been successfully applied to lattices up to dimension 40 and allows, for example, obtaining of generators for the automorphism group of the Leech lattice in less than 30 min on a HP 9000/730 workstation. (C) 1997 Academic Press Limited.

引用

页码：327 / 334

页数：8

共 14 条

[1]

BACHER R, 1993, THESIS U GENEVE

[2] NEIGHBORHOOD IN THE SENSE OF KNESER FOR QUATERNIONIC NETWORKS [J].