Lectures on Integer Matrices
نویسنده
چکیده
Introduction 2 Lecture 1. Hermite and Smith normal forms 3 Lecture 2. Integral similarity and the Latimer-MacDuffee-Taussky theorem 8 Lecture 3. Ideal class numbers, integral matrices nonderogatory modulo every prime and maximal orders of number fields 12 Lecture 4. Factorizations of integer matrices as products of elementary matrices, involutions etc 20 Lecture 5. Additive commutators. Solving polynomial equations using integer matrices 29 Bibliography. 36
منابع مشابه
On the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملRandom Matrix Theory
Random matrix theory is usually taught as a sequence of several graduate courses; we have 16 lectures, so we will give a very brief introduction. Some relevant books for the course: • G. Anderson, A. Guionnet, O. Zeitouni. An introduction to random matrices. [1] • A. Guionnet. Large random matrices: lectures on macroscopic asymptotics. • M. L. Mehta. Random matrices. The study of random matrice...
متن کاملPolyhedral Methods in Discrete Optimization
In the last decade our capability of solving integer programming problems has increased dramatically due to the effectiveness of cutting plane methods based on polyhedral investigations. Polyhedral cutting planes have become central features in optimization software packages for integer programming. Here we present some of the important polyhedral methods used in discrete optimization. We discu...
متن کامل