On the choice of pencils in the parametrization of curves (Q1209614)

The main result of this paper is an algorithm which takes as input a plane curve of genus 0 with only ordinary singularities, defined over an infinite perfect field \(K\), and outputs a parametrizaton of the curve defined at worst over a quadratic extension of \(K\). If the curve has odd order or if it posesses a \(K\)-conjugacy class consisting of an odd number of singularities with odd multiplicity, then the parametrization is defined over \(K\). It is stated that the algorithm can be adapted to curves with non-ordinary singularities. In contrast with the classical recipe for parametrizing a plane curve, which uses a pencil of adjoint curves, the present algorithm uses a pencil of curves which are not adjoints, though they are specified essentially by imposing conditions at the singular points of the curve to be parametrized. The conditions are obtained by solving a set of Diophantine equations. In good cases the pencil has low degree; however, this is not guaranteed. To cover the case of high degree, the author gives an alternative algorithm of D. Lazard.