pith. sign in

arxiv: 0807.4674 · v1 · submitted 2008-07-29 · 🧮 math.AG

How to Compute a Puiseux Expansion

classification 🧮 math.AG
keywords algorithmexplanationbranchescomputeexamplesexpansionexpansionsexplained
0
0 comments X
read the original abstract

In this paper, an explanation of the Newton-Peiseux algorithm is given. This explanation is supplemented with well-worked and explained examples of how to use the algorithm to find fractional power series expansions for all branches of a polynomial at the origin.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.