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

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

Divisor corresponding ideals of maximal orders.

<p><p>

<h3>
Syntax:
</h3>
<pre>L := AlffDivisorIdeals(D);</pre>

<p>

<table>
<tr>
<td>list</td>
<td><pre>  L  </pre></td>
<td>of finite and infinite ideals</td>
</tr>
<tr>
<td>alff divisor</td>
<td><pre>  D  </pre></td>
<td></td>
</tr>
</table>

<p>


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

<p>

<h3>
Description:
</h3>
Given an alff divisor D this function returns the ideals of the
finite and infinite maximal order whose ideal factorizations
define -D (note the minus sign).

<p><p>

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

<pre>

kash> AlffInit(FF(2,4));
"Defining global variables: k, w, kT, kTf, kTy, T, y, AlffGlobals"
kash> F := Alff(y^3+T^3*y+T);
Algebraic function field defined by
.1^3 + .1*.2^3 + .2
over
Univariate rational function field over GF(2^4)
Variables: T

kash> P := AlffPlaceSplit(F,T+1)[1];
Alff place < [ T + 1, 0, 0 ] >
kash> D := AlffDivisor(P);
Alff divisor
[ [ Alff place < [ T + 1, 0, 0 ] >, 1 ] ]

kash> I := AlffDivisorIdeals(D);
> [ < 
    [   1    0    0]
    [   0    1    0]
    [   0    0    1]
    / T + 1
     >, < [ 1, 0, 0 ] > ]

</pre>

<p>


<hr>

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