An algorithmic version of the theorem by Latimer and MacDuffee for 2\({\times}\)2 integral matrices

DOI10.1016/S0024-3795(01)00518-3zbMath0999.15024OpenAlexW2124708738MaRDI QIDQ1602984

Behn, Antonio, A. B. van der Merwe

Publication date: 24 June 2002

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(01)00518-3

zbMATH Keywords

algorithmcharacteristic polynomialintegral matrixmatrix solution

Mathematics Subject Classification ID

Matrices of integers (15B36)

Related Items (2)

Computation of lattice isomorphisms and the integral matrix similarity problem ⋮ Matrices in \(\mathbb{M}_2 [\mathbb{F}_q [T]\) with quadratic minimal polynomial]

Cites Work

• Meyer type wavelet bases in \(\mathbb R^{2}\)
• A correspondence between classes of ideals and classes of matrices
• Haar bases for \(L^ 2 (\mathbb{R}^ n)\) and algebraic number theory
• On a Theorem of Latimer and Macduffee
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithmic version of the theorem by Latimer and MacDuffee for 2\({\times}\)2 integral matrices