Computing Puiseux series: a fast divide and conquer algorithm
Computing Puiseux series: a fast divide and conquer algorithm
Let F∈𝕂[X,Y] be a polynomial of total degree D defined over a perfect field 𝕂 of characteristic zero or greater than D. Assuming F separable with respect to Y, we provide an algorithm that computes all singular parts of Puiseux series of F above X=0 in an expected Ø ˜(Dδ …