Extension of the Newton–Puiseux algorithm to the case of a nonzero characteristic ground field. I

Chistov, A.

doi:10.1090/spmj/1476

Extension of the Newton–Puiseux algorithm to the case of a nonzero characteristic ground field. I
HTML articles powered by AMS MathViewer

by A. L. Chistov
Translated by: the author

St. Petersburg Math. J. 28 (2017), 825-853

DOI: https://doi.org/10.1090/spmj/1476

Published electronically: October 2, 2017

PDF | Request permission

Abstract:

The Newton–Puiseux algorithm for constructing roots of polynomials in the field of fractional power series is generalized to the case of a ground field of nonzero characteristic.

References

A. L. Chistov, Polynomial complexity of the Newton-Puiseux algorithm, Mathematical foundations of computer science, 1986 (Bratislava, 1986) Lecture Notes in Comput. Sci., vol. 233, Springer, Berlin, 1986, pp. 247–255. MR 874601, DOI 10.1007/BFb0016248
A. L. Chistov, Effective construction of a nonsingular in codimension one algebraic variety over a zero-characteristic ground field, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 387 (2011), no. Teoriya Predstavleniĭ, Dinamicheskie Sistemy, Kombinatornye Metody. XIX, 167–188, 192 (English, with English and Russian summaries); English transl., J. Math. Sci. (N.Y.) 179 (2011), no. 6, 729–740. MR 2822513, DOI 10.1007/s10958-011-0623-0
A. L. Chistov, An algorithm of polynomial complexity for factoring polynomials, and determination of the components of a variety in a subexponential time, Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 137 (1984), 124–188 (Russian, with English summary). Theory of the complexity of computations, II. MR 762101