Abstract
We give a method of factoring integer matrices in Z n × n into components such that the factorization is not unique unless certain information is known. In Section 2, we introduce this method of factorization and provide theorems which establish its well-definedness. In Section 3, we construct a matrix in SL ( n , Z ) as a product of specific types of matrices and establish an algorithm for factoring the result uniquely given an amount of information.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
