Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Minkowski reduction of integral matrices

Author: John L. Donaldson
Journal: Math. Comp. 33 (1979), 201-216
MSC: Primary 10E25; Secondary 15A36, 68C05
MathSciNet review: 514819
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: In 1905 Hermann Minkowski introduced his theory of reduction of positive definite quadratic forms. Recently, Hans J. Zassenhaus has suggested that this theory can be applied to the problem of row reduction of matrices of integers. Computational investigations have shown that for matrices with more columns than rows, the number of steps required for reduction decreases drastically. In this paper it is proved that as the number of columns increases, the probability that a matrix is Minkowski reduced approaches one. This fact is the motivation behind the introduction of a modified version of Minkowski reduction, resulting in a reduction procedure more suitable for computation.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 10E25, 15A36, 68C05

Retrieve articles in all journals with MSC: 10E25, 15A36, 68C05

Additional Information

Article copyright: © Copyright 1979 American Mathematical Society