Browse > Article
http://dx.doi.org/10.14403/jcms.2011.24.4.9

ON IRREDUCIBILITY OF COMPOSITION POLYNOMIALS  

Choi, EunMi (Department of Mathematics HanNam University)
Publication Information
Journal of the Chungcheong Mathematical Society / v.24, no.4, 2011 , pp. 713-724 More about this Journal
Abstract
We investigate the irreducibility of iterate and composite polynomials. For this purpose discriminant and resultant are computed by means of the norm function.
Keywords
resultant; iterated polynomial; norm function;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Jones, The density of prime divisors in the arithmetic dynamics of quadratic polynomials, J. London Math. Soc. (2), 78 (2008), no. 2, 523-544.   DOI   ScienceOn
2 J. H. McKay, S. S. Wang. A chain rule for the resultant of two polynomials, Arch. Math. 53 (4). (1989) 347-351.   DOI   ScienceOn
3 R. K. W. Odoni, The Galois theory of iterates and composites of polynomials, Prod. London Math Soc. (3), 51 (1985), no. 3, 385-414.   DOI
4 J. R. Bastida, Field extensions and Galois theory, Encyclopedia of Mathematics and its applications, 22, Addison-Wesley Publishing Company, 1984.
5 R. G. Swan, Factorization of polynomials over finite field, Pacific Journal of Mathematics 12 (1962), 1099-1106.   DOI
6 J. J. Sylvester, On a general method of determining by mere inspection the derivation from two equations of any degree, Philosophical Magazine 16 (1840), 132-135.