Solving non-separable polynomials over the field of Puiseux series via golden lifting

2023/11/02 by Ebker, Ragon
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2311.06286

Abstract

We develop an iterative method to calculate the roots of arbitrary polynomials over the field of Puiseux series including non-separable ones. The method works by transforming the polynomial and its roots into a special form and then extracting a new, univariate polynomial that contains information about our roots. We also provide a working implementation of the algorithm in Python.

Related

• Computing Puiseux series : a fast divide and conquer algorithm
• How to Compute a Puiseux Expansion
• The Newton-Puiseux algorithm and effective algebraic series
• Computing Puiseux Series for Algebraic Surfaces
• Computing Real Roots of Real Polynomials