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

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

Finds shortest elements in a lattice.

<p><p>

<h3>
Syntax:
</h3>
<pre>L := LatShortestElt(Lambda);
L := LatShortestElt(Lambda,m);
L := LatShortestElt(Lambda,"all");</pre>

<p>

<table>
<tr>
<td>list of lattice elements</td>
<td><pre>  L  </pre></td>
<td></td>
</tr>
<tr>
<td>lattice</td>
<td><pre>  Lambda  </pre></td>
<td></td>
</tr>
<tr>
<td>integer</td>
<td><pre>  m  </pre></td>
<td></td>
</tr>
</table>

<p>


<h3>
Description:
</h3>
Please refer to "KASH{} - A User's Guide" for a general
description of the <tt> LatShortestElt</tt> function. \medskip

If <tt> m</tt> is specified, the <tt> LatShortestElt</tt> function
tries to find <tt> m</tt> shortest elements. If the
second argument is <tt> "all"</tt>, the <tt> LatShortestElt</tt>
function returns all shortest vectors.

<p><p>


<hr>

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