Factorization of multivariate polynomials by extended Hensel construction
ACM SIGSAM Bulletin
Visualization of extended Hensel factors
ACM Communications in Computer Algebra
ACM Communications in Computer Algebra
A numerical study of extended Hensel series
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Convergence domain of series expansions of multivariate algebraic functions
ACM Communications in Computer Algebra
Convergence and many-valuedness of hensel seriesnear the expansion point
Proceedings of the 2009 conference on Symbolic numeric computation
Good reduction of Puiseux series and applications
Journal of Symbolic Computation
A study of Hensel series in general case
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
A unified algorithm for multivariate analytic factorization
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Hi-index | 0.00 |
In 1993, Sasaki and Kako proposed a Hensel-like construction ofF(x,u1,¡,ul),l¡Ý 2, at a singular point where the conventionalgeneralized Hensel construction breaks down. In this paper, wefirst extend Sasaki-Kako's method so as to apply to polynomialswith vanishing leading coefficients. Then, we investigate a specialcase that the initial factors are polynomials. We prove that themultivariate polynomial can be decomposed at any singular pointinto factors which are polynomials in a main variable withcoefficients being (infinite) series of rational functions suchthat¡Æk=0¡Þ[Nk(u1¡,ul)/Dk(u1,¡,ul)].Here, Nk and Dk are homogeneouspolynomials in u1 -s1,¡,ul -sl and tdeg(Nk) -tdeg(Dk) = k, where(s1,¡,sl) is theexpansion point and tdeg denotes the total-degree. Theextended Hensel construction can be used to factorization ofmultivariate polynomials having a singular point at the origin.After performing the extended Hensel construction at the origin, wesearch for the smallest subsets of Hensel factors such that theproduct of the members of each subset contains no rationalfunction. Then, we obtain the factorization inK{u1,¡,ul}[x], with K a number field. Next, we search for thesmallest subsets such that the product of the members of eachsubset contains no infinite series. Then, we obtain thefactorization in K[x,u1,¡,ul], withoutemploying the so-called nonzero substitution.