We present an algorithm for the exact computer-aided construction of the Voronoi cells of lattices with known symmetry group. Our algorithm scales better than linearly with the total number of faces and is applicable to dimensions beyond 12, which previous methods could not achieve. The new algorithm is applied to the Coxeter-Todd lattice $K_{12}$ as well as to a family of lattices obtained from laminating $K_{12}$. By optimizing this family, we obtain a new 13-dimensional lattice, whose quantizer constant is smaller than any published at the time of submission. (For subsequent improvements, see Note added in proof after the Conclusions.)
翻译:我们提出了一种算法,用于在已知对称群的情况下,通过计算机辅助精确构造格点的Voronoi胞腔。该算法的计算复杂度随总面数的增长优于线性,适用于维度超过12的情况,这是先前方法无法实现的。新算法被应用于Coxeter-Todd格点$K_{12}$以及通过层叠$K_{12}$得到的一系列格点。通过优化该格点族,我们获得了一个新的13维格点,其量化器常数在投稿时小于所有已发表的结果。(关于后续改进,请参见结论后的附注。)