On the parametrization of an algebraic curve (Q2304502): Difference between revisions

Given an algebraic plane curve, the existence of a global uniformization is guaranteed by the Uniformization Theorem, but there is no an algorithm for its calculation. Currently, it is very well known how to parametrize the curve if its genus is equal to \(0\) or \(1\) or if its group of birational authomorphisms is sufficiently large. The main goal of the paper is to introduce a polyhedron method to obtain an arbitrarily exact piecewise parametrization of the curve. This method requires a new polyhedron, called by the author ``Hadamard polyhedron'', that involves the faces of the upper part of the boundary of a certain convex hull of points in \(\mathbb{R}^3\), whose coordinates are defined by means of the exponents of the powers of the variables of the terms of the polynomial \(f\) defining the curve, and the logarithm of the norm of the corresponding coefficient. This polyhedron allows to divide the space \(\mathbb{R}^2\) or \(\mathbb{C}^2\) into different sets in such a way that, in each set, the truncated polynomial of the polynomial specifying the curve is a well approximate parametrization. Next, the Newton method is also used to refine the approximate parametrization in each piece into which the space is divided.