Almost completely decomposable groups and integral linear algebra (Q1270961): Difference between revisions

The results are based on a new representation of almost completely decomposable groups which is valid more generally for finite essential extensions of torsion-free groups. These are obtained in the form \(X=A+\overset\rightharpoonup\mathbb{Z} N^{-1}a^\downarrow=A+\overset\rightharpoonup\mathbb{Z}\frac 1{\det N}(\text{adj }N)a^\downarrow\) where \(\overset\rightharpoonup\mathbb{Z}\) is the set of all \(1\times k\) integral matrices (\(k\)-tuples), \(N\) is a nonsingular integral \(k\times k\) matrix and \(a^\downarrow\) is a \(k\times 1\) matrix with entries from \(A\). Results of other papers written by the authors and/or M. A. Ouldbeddi are used. One major result of this paper is a completely general and effective criterion for deciding whether a completely decomposable group \(A\) is regulating in its finite essential extension \(X\). More precisely: Let \(A=\bigoplus_{\rho\in T_{cr}(A)}A_\rho\) be completely decomposable, and let \(X=A+\overset\rightharpoonup\mathbb{Z} N^{-1}a^\downarrow\) be a finite essential extension of \(A\) in standard form with \(\gcd^A(N,a^\downarrow)=I\). Write \(a^\downarrow=\sum_{\rho\in T_{cr}(X)}a_\rho^\downarrow\), where \(a_\rho^\downarrow\in A_\rho^\downarrow\). Then the following hold. 1. \(X(\tau)=A(\tau)+\overset\rightharpoonup\mathbb{Z} N_\tau{}^{-1}(\sum_{\rho\geq\tau}a_\rho^\downarrow)\) with \(\gcd^A(N_\tau,\sum_{\rho\geq\tau}a_\rho^\downarrow)=I\), where \(N_\tau=\gcd^A(N,\sum_{\rho\not\geq\tau}a_\rho^\downarrow)\). 2. \(X^\#(\tau)=A^\#(\tau)+\overset\rightharpoonup\mathbb{Z}(N_\tau^\#)^{-1}\) \((\sum_{\rho\geq\tau}a_\rho^\downarrow)\) with \(\gcd^A(N_\tau^\#,\sum_{\rho\geq\tau}a_\rho^\downarrow)=I\), where \(N_\tau^\#=\gcd^A(N,\sum_{\rho\not>\tau}a_\rho^\downarrow)\). 3. Write \(A(\tau)=A_\tau\oplus A^\#(\tau)\). Then \(\left|\frac{X(\tau)}{A_\tau\oplus X^\#(\tau)}\right|=\frac{\left|\det N_\tau\right|}{\left|\det N_\tau^\#\right|}\). 4. \(A\) is regulating in \(X\) iff \(\det N_\tau=\pm\det N_\tau^\#\). In the 6-th section an example is studied (20 pages) with the help of Maple V procedures. This demonstrates that computer tools mixed with ad hoc methods allow one to find regulating subgroups even in large groups. The last section deals with applications, prospects and open questions.