A Simple Algorithm for Deciding Primes in K[[x,y]]
Canadian journal of mathematics, Tome 47 (1995) no. 4, pp. 801-816
Voir la notice de l'article provenant de la source Cambridge University Press
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.
kuo, Tzee Char. A Simple Algorithm for Deciding Primes in K[[x,y]]. Canadian journal of mathematics, Tome 47 (1995) no. 4, pp. 801-816. doi: 10.4153/CJM-1995-041-9
@article{10_4153_CJM_1995_041_9,
author = {kuo, Tzee Char},
title = {A {Simple} {Algorithm} for {Deciding} {Primes} in {K[[x,y]]}},
journal = {Canadian journal of mathematics},
pages = {801--816},
year = {1995},
volume = {47},
number = {4},
doi = {10.4153/CJM-1995-041-9},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1995-041-9/}
}
[1] 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] 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] 3. Moh, T.T., On the approximate roots of a polynomial, Crelle 278(1974), 301–306. Google Scholar
Cité par Sources :