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

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

Computes the successive minima of a lattice.

<p><p>

<h3>
Syntax:
</h3>
<pre>L := LatSuccMins(Lambda);</pre>

<p>

<table>
<tr>
<td>list</td>
<td><pre>  L  </pre></td>
<td></td>
</tr>
<tr>
<td>lattice</td>
<td><pre>  Lambda  </pre></td>
<td></td>
</tr>
</table>

<p>


<h3>
Description:
</h3>
The <tt> LatSuccMins</tt> function computes the successive
minima of a lattice and a set of corresponding lattice
elements.

<p><p>

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

<pre>

kash> o := Order(Poly(Zx, [1, 13, 13, 13, 169]));;
kash> Lambda := Lat(o);;
kash> LatSuccMins(Lambda);
> [ [ -1 0 0 0 ]
    , 4, [ -3 -1 0 0 ]
    , 117.710223325529930087190601154781784396363864536308, [ 0 -11 -1 0 ]
    , 2098.727873763335276613028969537316945979798627539353, [ -13 -3 -12 -1 ]
    , 13067.65742584099018040789043545504811128068694482 ]

</pre>

<p>


<hr>

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