Reduction of matrices over orders of imaginary quadratic fields
For square matrices of size 2 by 2, \textit{P. M. Cohn} [Publ. Math., Inst. Hautes Étud. Sci. 30, 365--413 (1966; Zbl 0144.26301)] has used the concept of a standard form which is a very important tool for the investigation of \(GE_2\)-rings. In this paper a special decomposition (called the near standard form) of \((1,2)\)-matrices over a ring is introduced and a method for a reduction of such matrices is explained. This is applied for a detection of elementary second order matrices among invertible second order matrices. The tool is used in detail over orders of imaginary quadratic fields, where an algorithm, a number of properties and examples are presented.
- Reduction theory over quadratic imaginary fields
- Lattice Reduction Over Imaginary Quadratic Fields
- Good reduction of elliptic curves over imaginary quadratic fields
- Reduction of elliptic curves over certain real quadratic number fields
- On the complexity of matrix reduction over finite fields
- Publication:4502502
- Elementary matrix reduction over certain rings
- A generalization of LLL lattice basis reduction over imaginary quadratic fields
- A Class of Quadratic Matrix Equations over Finite Fields
- Reducibility of polynomials over algebraic number fields
- The number of standard forms of matrices over imaginary Euclidean quadratic rings with respect to the \((z,k)\)-equivalence
- Euclid meets Popeye: the Euclidean algorithm for 2 2 matrices
- Cube-root-subgroups of \(\operatorname{SL}_2\) over imaginary quadratic integers
- Rings with invertible matrices necessarily containing units
This page was built for publication: Reduction of matrices over orders of imaginary quadratic fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551313)