On the estimation of coefficients of irreducible factors of polynomials over a field of formal power series in nonzero characteristic

Cover Page

Cite item

Full Text

Abstract

We discuss some problems and results related to the Newton-Puiseux algorithm and its generalization for nonzero characteristic obtained by the author earlier. A new method is suggested for obtaining effective estimations of the roots of a polynomial in the field of fraction-power series in arbitrary characteristic.

About the authors

A. L. Chistov

Saint-Petersburg Department of Steklov Mathematical Institute of the Russian Academy of Sciences

Author for correspondence.
Email: alch@pdmi.ras.ru
Russian Federation, 191023, St. Petersburg, Fontanka emb., 27

References

  1. Чистов А.Л. Расширение алгоритма Ньютона-Пюизе на случай ненулевой характеристики основного поля. I // Алгебра и анализ. 2016. Т. 28. № 6. С. 147-188.
  2. Chistov A.L. Polynomial Complexity of the Newton-Puiseux Algorithm / In: Ed. J. Gruska, B. Rovan. Wiedermann International Symposium on Mathematical Foundations of Computer Science 1986. Lecture Notes in Computer Science. Springer-Verlag, 1986. V. 233. P. 247-255.
  3. Боревич З.И., Шафаревич И.Р. Теория чисел. М.: Наука, 1964.

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Russian academy of sciences

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies