4,857 research outputs found
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
Given a nonsingular matrix of univariate polynomials over a
field , we give fast and deterministic algorithms to compute its
determinant and its Hermite normal form. Our algorithms use
operations in ,
where is bounded from above by both the average of the degrees of the rows
and that of the columns of the matrix and is the exponent of matrix
multiplication. The soft- notation indicates that logarithmic factors in the
big- are omitted while the ceiling function indicates that the cost is
when . Our algorithms are based
on a fast and deterministic triangularization method for computing the diagonal
entries of the Hermite form of a nonsingular matrix.Comment: 34 pages, 3 algorithm
Natural Density Distribution of Hermite Normal Forms of Integer Matrices
The Hermite Normal Form (HNF) is a canonical representation of matrices over
any principal ideal domain. Over the integers, the distribution of the HNFs of
randomly looking matrices is far from uniform. The aim of this article is to
present an explicit computation of this distribution together with some
applications. More precisely, for integer matrices whose entries are upper
bounded in absolute value by a large bound, we compute the asymptotic number of
such matrices whose HNF has a prescribed diagonal structure. We apply these
results to the analysis of some procedures and algorithms whose dynamics depend
on the HNF of randomly looking integer matrices
A Canonical Form for Positive Definite Matrices
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 partition-backtracking graph
software. The algorithm runs in a number of arithmetic operations that is
exponential in the dimension , but it is practical and more efficient than
canonical forms based on Minkowski reduction
- …