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

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

Computes an approximating element of an algebraic function field F.

<p><p>

<h3>
Syntax:
</h3>
<pre>alpha := AlffEltApprox(S, Lambda, A [,a]);</pre>

<p>

<table>
<tr>
<td>element</td>
<td><pre>  alpha  </pre></td>
<td>of the algebraic function field F</td>
</tr>
<tr>
<td>list</td>
<td><pre>  S  </pre></td>
<td>of places of F</td>
</tr>
<tr>
<td>alff divisor </td>
<td><pre>  A  </pre></td>
<td></td>
</tr>
<tr>
<td>list</td>
<td><pre>  a  </pre></td>
<td>of elements of F</td>
</tr>
</table>

<p>


<h3>
Description:
</h3>
Let F be an algebraic function field,
S = {P_1,\dots,P_r} a set of r places
of F (r a positive integer),
\Lambda = {n_1,\dots,n_r} a list of r
integers and a = {a_1,\dots,a_r} a list of r elements of F
(if a is not given as a parameter, then a_i is assumed be a zero
for all i).
Let A be
a divisor of F whose support Supp(A) is disjoint to S
and whose degree is positive.
Then this function computes an element \alpha of F with

(1) v_{P_i}(\alpha) = n_i (i=1,\dots,r) and

(2) v_{P}(\alpha)  &gt;=  0 for all P\in F, P\notin (Scup Supp(A)).


<p><p>

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

<pre>

</pre>

<p>


<hr>

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