Next: Lie Theory
Up: Lattices
Previous: Lattices
Lattices
New Features:
- The intrinsic AutomorphismGroup(L, F)
has been extended to
compute the subgroup of the automorphism group of a lattice which
fixes a collection of forms setwise.
The forms are not required to be positive definite or even
symmetric.
This is a variation of the partition-refinement backtrack lattice
automorphism program developed by Bill Unger in 2010 so it is fast.
The new algorithm also applies to computing an isometry between two
lattices which carries a set of forms attached to one lattice to a set
attached to the second.
- The intrinsic IsRationallyEquivalent tests whether a pair of lattices
are rationally equivalent.
Changes and Removals:
- The WittInvariants intrinsic now has a Minimize vararg.
Bug Fixes:
- The pSignatures and pExcesses intrinsics now return
an empty sequence when the input has determinant zero.
- A bug when computing isometries of lattices with large entries
in the Gram matrix has been fixed.
- A memory leak when computing automorphisms and isometries of lattices
has been fixed.
Next: Lie Theory
Up: Lattices
Previous: Lattices