Extension of expansion base algorithm for multivariate analytic factorization including the case of singular leading coefficient
Maki Iwami · ACM SIGSAM Bulletin · 2005
The expansion base algorithm, which was devised by Abhyankar, Kuo and McCallum is very efficient for analytic factorization of bivariate polynomials. The author had extended it to more than two variables but it was only for polynomials with non-vanishing leading coefficient at the expansion point. We improve it to be able to apply to polynomials including the case of vanishing leading coefficient, that is, singular leading coefficient, which comes to a specific problem only for more than two variables.