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

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

Whether there is a next divisor in the linear series enumeration.

<p><p>

<h3>
Syntax:
</h3>
<pre>b := AlffLinearSeriesEnumNext(env);</pre>

<p>

<table>
<tr>
<td>bool</td>
<td><pre>  b  </pre></td>
<td>whether there is a next divisor</td>
</tr>
<tr>
<td>record</td>
<td><pre>  env  </pre></td>
<td>of enumeration data</td>
</tr>
</table>

<p>


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

<p>

<h3>
Description:
</h3>
Let F/k be a global function field and D a divisor.
Let v_1, \dots, v_l be k-linearly independent
elements of F. This function
returns <tt> true</tt> or <tt> false</tt> with respect to whether there
is a not yet considered divisor in a linear series enumeration
of the form D + \bigl( \sum_{i=1}^l \lambda_i v_i \bigr)
and increases
an internal counter.

<p><p>

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

<pre>

</pre>

<p>


<hr>

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