An iterative construction of irreducible polynomials reducible modulo every prime

9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f∈F[x] whose iterates have the desired property, and it depends on new criteria ensuring all iterates of f are irreducible. In particular when F is a number field in which the ideal (2) is not a square, we construct infinitely many families of quadratic f such that every iterate f n is irreducible over F, but f n is reducible modulo all primes of F for n≥2. We also give an example for each n≥2 of a quadratic f∈Z[x] whose iterates are all irreducible over Q, whose (n-1)st iterate is irreducible modulo some primes, and whose nth iterate is reducible modulo all primes. From the perspective of Galois theory, this suggests that a well-known rigidity phenomenon for linear Galois representations does not exist for Galois representations obtained by polynomial iteration. Finally, we study the number of primes p for which a given quadratic f defined over a global field has f n irreducible modulo p for all n≥1. © 2012 Elsevier Inc.

Cite

CITATION STYLE

APA

Jones, R. (2012). An iterative construction of irreducible polynomials reducible modulo every prime. Journal of Algebra, 369, 114–128. https://doi.org/10.1016/j.jalgebra.2012.05.020

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free