Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-22T16:55:05.068Z Has data issue: false hasContentIssue false
  • English
  • Français

A Simple Algorithm for Deciding Primes in K[[x,y]]

Published online by Cambridge University Press:  20 November 2018

Tzee Char kuo
Tzee Char kuo*
Affiliation:
School of Mathematics and Statistics, University of Sydney, New South Wales 2006, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The well-known Tschirnhausen transformation, , eliminates the second term of the polynomial xn + axn-l + …. By a mere repeated application of this transformation, one can decide whether a given element of k[[x,y]] is prime (irreducible) or not. Here K is an algebraically closed field of characteristic 0. A generalised version of Hensel's Lemma is developed for the proofs. The entire paper can be understood by undergraduate students.

Keywords

13143268
Type
Research Article
Information
Canadian Journal of Mathematics , Volume 47 , Issue 4 , 01 August 1995 , pp. 801 - 816
Copyright
Copyright © Canadian Mathematical Society 1995

References

1. Abhyankar, S. and Moh, T.T., Newton-Puiseux expansion and generalised Tschirnhausen transformation I, II,J. Reine Angew. Math. 260(1973), 47–83. ibid. 261(1973), 29–54.Google Scholar
2. Kuo, T.-C., Generalised Newton-Puiseux theory and Hensel's lemma in C[[x,y]], Canad. J. Math. (6) XLI(1989), 1101–1116.Google Scholar
3. Moh, T.T., On the approximate roots of a polynomial, Crelle 278(1974), 301–306.Google Scholar