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

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

Performs the Dedekind-Test on an equation order in an algebraic
function field.

<p><p>

<h3>
Syntax:
</h3>
<pre>b := AlffOrderDedekindTest(o);
b := AlffOrderDedekindTest(o, g);</pre>

<p>

<table>
<tr>
<td>boolean</td>
<td><pre>  b  </pre></td>
<td></td>
</tr>
<tr>
<td>algebraic function field order</td>
<td><pre>  o  </pre></td>
<td></td>
</tr>
<tr>
<td>polynomial</td>
<td><pre>  g  </pre></td>
<td></td>
</tr>
</table>

<p>


<h3>
Description:
</h3>
Let o be an equation order in an algebraic function field
F/k(T). Invoked with one argument, the function returns
whether o is 1/T-maximal or not. Invoked with a prime polynomial
g \in k[T], the function returns whether o is g-maximal or
not.

<p><p>

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

<pre>

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

kash> AlffOrderDedekindTest(AlffOrderEqFinite(F), T+1);
true
kash> AlffOrderDedekindTest(AlffOrderEqInfty(F));
> false

</pre>

<p>


<hr>

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