2026-06-26T20:14:31Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/576432023-08-27T16:17:32Zcom_20.500.14352_14col_20.500.14352_15

Luengo Velasco, Ignacio Raimondo , Mario Alonso García, María Emilia 2023-06-20T17:01:28Z 2023-06-20T17:01:28Z 1989 0302-9743 10.1007/3-540-51082-6_76 https://hdl.handle.net/20.500.14352/57643 http://www.springerlink.com/content/y57m4130345633hg/ http://www.springerlink.com/ Let K be a field of characteristic O, and let R denote K[X] or K[[X]]. It is well known that the roots of a polynomial FisinR[Z] are fractional powers series in K[[X 1d/]], where Kmacr is a finite extension of K and disin N, and they can be obtained by applying the Newton Puiseux algorithm. Although this is not true for polynomials in more than one variable, there is an important class of polynomials FisinR[Z] (R=K[[X 1, . . ., X n]]=K[[Xlowbar]]), called quasi-ordinary (QO) polynomials, for which the same property holds (i.e. their roots are fractional power series in Kmacr[[Xlowbar 1d/]]). The goal of the paper is to give an algorithm to compute these fractional power series for K (a computable field) and n=2 metadata only access An algorithm on quasi-ordinary polynomials journal article