Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

Unimodular transformation matrix of LLL algorithm

 Dear all,   I asked this in sage-support group also.     I have a matrix M1 with integer entries with 90 rows and 6 columns. After applying LLL algorithm of M1, I get M2=M1.LLL(). I want to get corresponding unimodular transformation matrix T such that T*M1=M2. We can find T by T=M2*M1.pseudoinverse() or T== M1.solve_left(M2), but determinant of T becomes 0 i.e.,  T.det()=0. I want T.det()=1.

Best regards, Santanu
click to hide/show revision 2
None

Unimodular transformation matrix of LLL algorithm

 

Dear all, all,

I asked this in sage-support group also. also.

I have a matrix M1 with integer entries with 90 rows and 6 columns. After applying LLL algorithm of M1, I get M2=M1.LLL(). I want to get corresponding unimodular transformation matrix T such that T*M1=M2. T*M1=M2.

We can find T by T=M2*M1.pseudoinverse() or T== M1.solve_left(M2), but determinant of T becomes 0 i.e., T.det()=0. I want T.det()=1. T.det()=1.

Best regards, Santanu

Santanu

Unimodular transformation matrix of LLL algorithm

Dear all,

I also asked this in sage-support group also.question on sage-support.

I have a matrix M1 M1 with integer entries with 90 rows and 6 columns. After applying the LLL algorithm of to M1, I get M2=M1.LLL(). M2 = M1.LLL(). I want to get the corresponding unimodular transformation matrix T T such that T*M1=M2.T * M1 = M2.

We can find T by T by T=M2*M1.pseudoinverse() = M2 * M1.pseudoinverse() or T== M1.solve_left(M2), T = M1.solve_left(M2), but determinant of T T becomes 0 0 i.e., T.det()=0. T.det() equals 0. I want T.det()=1.

Best regards, SantanuT.det() to equal 1.