We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partitionbacktracking graph software. The algorithm runs in a number of arithmetic operations that is exponential in the dimension n, but it is practical and more efficient than canonical forms based on Minkowski reduction.
No takes yet. Share an insight, caveat, or question.
Sikirić et al. (2020) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: