A place of
is represented by a triple, consisting of
Note that the conjugates of a place are given by the triples
HN
, where
HN
runs through
the conjugates of
HN. Hence, when computing the closed
places of
, we can restrict ourselves to computing one representing
place for each. We apply the following algorithm:
Here, by a triangular basis one denotes a reduced
lexicographical Gröbner basis of the form
with
a monic polynomial in
and
.
Triangular systems can be computed effectively,
basically by two different methods, one
due to Lazard [27,7], the other due to Möller
[31].
Choose any of these methods to compute a triangular system for
,
,
.
For each
,
We denote by
the subset
of closed singular points. To check whether a point
is
singular or not, one has to check whether
(these computations can be performed over the finite field
extension
).
Finally, consider the (closed) point
: if
then
has to be added to
; if, additionally,
and
vanish then it has to be added to
, too.
The sets
(resp.
) are the sets of closed
(singular) points at infinity.
The computation of the symbolic Hamburger-Noether expressions has
to be performed in the local ring
where
is a primitive field extension (of degree
) such that
decompose into linear factors.
Note that during the computation of a sHNE further field
extensions might be necessary.