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
β¦ LIBER β¦
On the elementary divisors of the Sylvester and Lyapunov maps
β Scribed by P.A. Fuhrmann; U. Helmke
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 260 KB
- Volume
- 432
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the Computation of Elementary Divisor
β
Frank LΓΌbeck
π
Article
π
2002
π
Elsevier Science
π
English
β 229 KB
An elementary proof of a theorem of ErdΓΆ
β
Robert E. Dressler
π
Article
π
1972
π
Elsevier Science
π
English
β 201 KB
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
Coupling sensitivity of chaos and the Ly
β
Hiroaki Daido
π
Article
π
1985
π
Elsevier Science
π
English
β 435 KB
Generalized Lyapunov characteristic indi
β
C. FroeschlΓ©; Ch. FroeschlΓ©; E. Lohinger
π
Article
π
1993
π
Springer Netherlands
π
English
β 383 KB
On the explicit solutions of forms of th
β
Mohamed A. Ramadan; Mokhtar A. Abdel Naby; Ahmed M.E. Bayoumi
π
Article
π
2009
π
Elsevier Science
π
English
β 450 KB