IRREDUCIBLE POLYNOMIALS WITH REDUCIBLE COMPOSITIONS

• Journal title : Honam Mathematical Journal
• Volume 33, Issue 3,  2011, pp.355-366
• Publisher : The Honam Mathematical Society
• DOI : 10.5831/HMJ.2011.33.3.355
Title & Authors
IRREDUCIBLE POLYNOMIALS WITH REDUCIBLE COMPOSITIONS
Choi, Eun-Mi;

Abstract
In this paper we investigate criteria that for an irreducible monic quadratic polynomial f(x) $\small{{\in}}$ $\small{\mathbb{Q}}$[x], $\small{f{\circ}g}$ is reducible over $\small{\mathbb{Q}}$ for an irreducible polynomial g(x) $\small{{\in}}$ $\small{\mathbb{Q}}$[x]. Odoni intrigued the discussion about an explicit form of irreducible polynomials f(x) such that $\small{f{\cric}f}$ is reducible. We construct a system of infitely many such polynomials.
Keywords
Resultant;Discriminant;Iterated polynomial;
Language
English
Cited by
References
1.
N. Ali, On the irreducibility for composition of polynomials. International Mathematical Forum, 4, (40), 2009, 2001-2008

2.
L. Danielson, B. Fein. On the irreducibility of iterates of $x^n-b$, The Americal Math. Soc. 130 (2011), 1589-1596.

3.
R.K.W. Odoni. The Galois theory of iterates and composites of polynomials, Prod. London Math Soc. (3), 51 (3), 1985, 385-414

4.
R.K.W. Odoni. On the prime divisors of the sequence $w_{n+1}=1+w_1{\cdot}{\cdot}{\cdot}w_n.$ J. London Math. Soc. 32 (1985), 1-11.