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

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

Computes higher differentiations of function field elements.

<p><p>

<h3>
Syntax:
</h3>
<pre>b := AlffDifferentiation(p, m, a);</pre>

<p>

<table>
<tr>
<td>alff element</td>
<td><pre>  b  </pre></td>
<td>m-times differentiated element</td>
</tr>
<tr>
<td>integer </td>
<td><pre>  m  </pre></td>
<td></td>
</tr>
<tr>
<td>alff place or element </td>
<td><pre>  p  </pre></td>
<td></td>
</tr>
<tr>
<td>alff element</td>
<td><pre>  a  </pre></td>
<td>element to differentiate</td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#AlffDiff">AlffDiff</a>, <a href="kashref.html#AlffWronskian">AlffWronskian</a>, <a href="kashref.html#AlffRamDivisor">AlffRamDivisor</a>

<p>

<h3>
Description:
</h3>
Let F/k be an algebraic function field.
For a separating element p and an integer m this
function returns the m-th differentiation of a \in F.
If p is a place, a local parameter of the place as returned
by <tt> AlffPlacePrimeElt()</tt> is taken. Remark: The
implementation
is currently not efficient if m is larger than the positive
characteristic.

<p><p>

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

<pre>

</pre>

<p>


<hr>

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