
TL;DR
This paper discusses the computation of Puiseux series, highlighting common pitfalls in their calculation near branch points and cuts, and provides methods to avoid these errors in manual and software implementations.
Contribution
It identifies key issues in computing Puiseux series, especially near branch points, and offers strategies to prevent errors in both manual derivation and software implementation.
Findings
Common pitfalls in Puiseux series computation near branch points
Errors in series expansions can lead to incorrect complex values
Strategies to avoid these errors in practice
Abstract
Puiseux series are power series in which the exponents can be fractional and/or negative rational numbers. Several computer algebra systems have one or more built-in or loadable functions for computing truncated Puiseux series. Some are generalized to allow coefficients containing functions of the series variable that are dominated by any power of that variable, such as logarithms and nested logarithms of the series variable. Some computer algebra systems also have built-in or loadable functions that compute infinite Puiseux series. Unfortunately, there are some little-known pitfalls in computing Puiseux series. The most serious of these is expansions within branch cuts or at branch points that are incorrect for some directions in the complex plane. For example with each series implementation accessible to you: Compare the value of (z^2 + z^3)^(3/2) with that of its truncated series…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation
