Automorphisms and canonical forms of integer lattices
Simon Brandhorst, Tommy Hofmann
Abstract
We improve the Plesken--Souvignier algorithm for computing automorphism groups and isometries of positive definite integer quadratic lattices by exploiting characteristic sublattices and refining vector enumeration. For lattices with roots, we also use the Weyl group to accelerate the computation of canonical forms. Experiments with concrete implementations demonstrate substantial speedups and show that canonical forms can be computed at a cost comparable to that of computing automorphism groups.
Create a lesson
Related papers
CM fibers of Shimura parametrizations and thirteen proofs of the class number one theorem
Jingxuan Geng
The WZ pair and finite congruences
Xiang Chen, Junyan Liu, Hengfei Lu
On Solvable Automorphism Groups of Function Fields over Finite Fields
Henning Stichtenoth, Chaoping Xing, Zugan Xing
Pointwise improvement of the error term in the higher rank hyperbolic lattice counting problem
Dimitrios Chatzakos, Panagiotis Dimakis, Christos Katsivelos
Sparse Lifts of q-Linearized Permutation Polynomials with Explicit Inverses
Yi Li
The ring of values of E-functions is not a field
Stéphane Fischler, Tanguy Rivoal