𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Computation of Elementary Divisors of Integer Matrices

✍ Scribed by Frank Lübeck


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
229 KB
Volume
33
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis


We describe a "semi-modular" algorithm which computes for a given integer matrix A of known rank and a given prime p the multiplicities of p in the factorizations of the elementary divisors of A. Here "semi-modular" means that we apply operations to the integer matrix A but the operations are driven by considering only reductions of row vectors modulo p.


📜 SIMILAR VOLUMES


The Elementary Divisors of the Incidence
✍ Peter Sin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 98 KB

The elementary divisors of the incidence matrices between points and linear subspaces of fixed dimension in n p are computed. © 2000 Academic Press between the associated G-permutation modules which sends an r-subspace to the (formal) sum of the 1-subspaces it contains. This homomorphism has a fini

On the Proximity of Algebraic Units To D
✍ G.R. Everest 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 493 KB

An asymptotic formula counting algebraic units with respect to a proximity function on the group variety is given. The proximity function measures the local distance to a divisor on the variety. The formula allows a natural definition of mean distance between the group and the divisor. By allowing t

Fast Computation of the Bezout and Dixon
✍ Eng-Wee Chionh; Ming Zhang; Ronald N. Goldman 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 264 KB

Efficient algorithms are derived for computing the entries of the Bezout resultant matrix for two univariate polynomials of degree n and for calculating the entries of the Dixon-Cayley resultant matrix for three bivariate polynomials of bidegree (m, n). Standard methods based on explicit formulas re