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

<p>&nbsp;<p>
<hr noshade size="5">
<h2><a name="OrderUnitsLLL"></a>
OrderUnitsLLL
</h2>

Computes a LLL reduced system of independent units.

<p><p>

<h3>
Syntax:
</h3>
<pre>OrderUnitsLLL (O);</pre>

<p>

<table>
<tr>
<td>order</td>
<td><pre>  O  </pre></td>
<td></td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#OrderLLL">OrderLLL</a>, <a href="kashref.html#OrderUnitsPFund">OrderUnitsPFund</a>

<p>

<h3>
Description:
</h3>
The given absolute order O has to be maximal.
Computes a LLL reduced representation of the units given in O.
If no units have been computed so far, an arbitrary system of
independent units is computed in advance.

<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>

<pre>
kash>  O := OrderMaximal(x^3+x^2-2*x-1);
Generating polynomial: x^3 + x^2 - 2*x - 1
Discriminant: 49 

kash> OrderUnitsLLL(O);
> [ [-1, 1, 0], [5, -1, -2] ]

</pre>

<p>


<hr>

<p>
<a href="../kashref.html"><- back</a>[back] [prev] [next] [index] [root]