The Newton-Puiseux algorithm and effective algebraic series
From MaRDI portal
Publication:6409534
Abstract: We explain how to encode an algebraic series by a finite amount of data, namely its minimal polynomial, a total order and its first terms with respect to this order, and how to do effective arithmetic on the level of these encodings. The reasoning is based on the Newton-Puiseux algorithm and an effective equality test for algebraic series. We also explain how to derive information about the support of an algebraic series, e.g. how to compute the vertices and bounded faces of the convex hull of its support.
This page was built for publication: The Newton-Puiseux algorithm and effective algebraic series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409534)
