Rational algebraic curves. A computer algebra approach (Q996096)

The central problem in the book is the question whether a given algebraic curve is parametrizable and in case to compute a good rational parametrization. This involves an analysis of the singularities to compute the genus of the curve. The first chapter gives a motivation using some examples of applications (solution of Diophantine equations, solution of certain differential equations, computer aided geometric design). It is followed by the basics of plane algebraic curves (including rational functions, intersection of curves, linear systems, local parametrizations and Puiseux series). The third chapter is devoted to the genus. Blowing ups are used to reduce the computation of the genus to curves with only ordinary singularities. The problem of carrying out the computations of the genus over the smallest possible field is studied. Chapter 4 is the central chapter of the book. The notion of a rational parametrization of a curve is introduced and studied together with various problems related to such a rational parametrization. The chapter also deals with the problem of deciding whether a curve is rational and computing a rational parametrization. There is also a symbolic treatment at the end. The next chapter analyses the degree of the field extension necessary for representing coefficients of the parametrization and explains how to compute an optimal parametrization, i.e. with minimal degree. Chapter 6 studies rational reparametrization (focussing to proper, polynomial respectively normal parametrization). In the next chapter real curves are studied. It is proved that a real curve which can be parametrized over an algebraically closed field can also be parametrized over the real numbers. The problem, given a complex parametrization, to decide whether the curve is real and determines a real parametrization, is studied. There are several exercises at the end of each chapter. Each chapter contains explicit algorithms. The algorithms are implemented in the programme system CASA, a Maple package. The system CASA is described and explained in appendix A. Appendix B contains some algebraic preliminaries (ring and field theory, polynomials and power series, elimination theory). The book is a good basis for graduate students specializing in constructive algebraic curve geometry. It can be used for lectures and seminars in computer algebra based on Maple and CASA.