[back] [prev] [next] [index] [root]

 


IdealBasisLowerHNF

The basis of the ideal transformed in lower HNF

Syntax:

M:=IdealBasisLowerHNF(I);

list
  M  
two elements, the denominator and the basis matrix
ideal
  I  

See also:  IdealBasisUpperHNF, IdealLowerHNFTrans

Description:

This returns the basis of the ideal transformed in lower HNF. The basis is computed from the actual (which can be seen with IdealBasis). Once computed the basis in lower HNF is stored in the ideal data structure so it has not to be computed again.


Example:


kash> O:=OrderMaximal(Order(Poly(Zx,[1,4,1,-4,-3,7])));
Generating polynomial: x^5 + 4*x^4 + x^3 - 4*x^2 - 3*x + 7
Discriminant: 28442269 

kash> I:=Ideal(O,Mat(Z,[[1,2,1,4,6],[3,8,4,6,2],[6,4,3,3,8],
> [3,2,7,9,5],[0,2,8,8,4]]),1);
<
[1 2 1 4 6]
[3 8 4 6 2]
[6 4 3 3 8]
[3 2 7 9 5]
[0 2 8 8 4]
>

kash> IdealBasisLowerHNF(I);
> [ 1, [   1    0    0    0    0]
    [   0    1    0    0    0]
    [   0    0    1    0    0]
    [   0    1    0    3    0]
    [ 512  910  858 1672 1678] ]


<- back[back] [prev] [next] [index] [root]