Algorithms for curves with one place at infinity (Q898275)

In this paper the authors present three procedures which are part of the NumericalSgps GAP package (see \url{http://cmup.fc.up.pt/cmup/mdelgado/numericalsgps/}). These procedures are: {\parindent=6mm \begin{itemize} \item[-] \textsl{Semigroup of values of plane curve with single place at infinity}. Given an algebraic plane curve \(f\), it checks if \(f\) has one place at infinity; if so, it computes the generators of its semigroup of values and its approximate roots. This algorithm is based on \textit{S. S. Abhyankar} [Adv. Math. 74, No. 2, 190--257 (1989; Zbl 0683.14001)] and is the main novelty of the paper. \item [-] \textsl{Curve associated to delta sequence}. Given a \(\delta\)-sequence \(l\), it computes a curve whose semigroup of values is generated by \(l\). This algorithm corresponds with Algorithm 1 in [\textit{M. Fujimoto} and \textit{M. Suzuki}, Osaka J. Math. 39, No. 4, 1005--1027 (2002; Zbl 1053.14069)]. \item [-] \textsl{Delta sequences with Frobenius number}. Given a positive integer \(g\), it computes the set of all \(\delta\)--sequences generating numerical semigroups with Frobenius number \(g\). \end{itemize}} Finally, at the end of the paper, the authors give an example of a polynomial which does not have a unique embedding in the plane and the same example provides a counterexample for the conjecture stated in [\textit{V. Shpilrain} and \textit{J.-T. Yu}, J. Algebra 217, No. 2, 668--678 (1999; Zbl 0964.14025)].