An iterative construction of irreducible polynomials reducible modulo every prime

DOI10.1016/J.JALGEBRA.2012.05.020zbMATH Open1302.11086arXiv1012.2857OpenAlexW2963739610MaRDI QIDQ1946103FDOQ1946103

Rafe Jones

Publication date: 17 April 2013

Published in: Journal of Algebra (Search for Journal in Brave)

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 in 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 at least 2. We also give an example for each n of a quadratic f with integer coefficients whose iterates are all irreducible over the rationals, 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.

Full work available at URL: https://arxiv.org/abs/1012.2857

zbMATH Keywords

polynomial iterationalgebraic number theoryirreducibility of polynomials

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09) Dynamical systems over global ground fields (37P15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Galois theory of iterated endomorphisms
• Settled polynomials over finite fields
• The density of prime divisors in the arithmetic dynamics of quadratic polynomials
• Surjectivity criteria for \(p\)-adic representations. I.
• Realising wreath products of cyclic groups as Galois groups
• Galois group over \(\mathbb{Q}\) of some iterated polynomials
• The Galois Theory of Iterates and Composites of Polynomials
• On stable quadratic polynomials
• On the length of critical orbits of stable quadratic polynomials
• Irreducibility of the iterates of a quadratic polynomial over a field
• Stabilité des polynômes
• Integer Polynomials that are Reducible Modulo all Primes
• Irreducible polynomials which are locally reducible everywhere
• On the Prime Divisors of the Sequence W _{n +1} = 1 + W ₁ …W _n
• On the irreducibility of the iterates of \(x^{n}-b\)
• Variation of periods modulo \(p\) in arithmetic dynamics
• Properties of Iterates and Composites of Polynomials

Cited In (16)

• The set of stable primes for polynomial sequences with large Galois group
• The Vojta conjecture implies Galois rigidity in dynamical families
• Algorithm for studying polynomial maps and reductions modulo prime number
• Riccati equations and polynomial dynamics over function fields
• On Sets of Irreducible Polynomials Closed by Composition
• On the existence of infinite, non-trivial \(F\)-sets
• On iterated extensions of number fields arising from quadratic polynomial maps
• Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap
• Prime divisors in polynomial orbits over function fields
• Irreducibility of iterates of post-critically finite quadratic polynomials over \(\mathbb{Q}\)
• Eventually stable rational functions
• Dynamical irreducibility of polynomials modulo primes
• Current trends and open problems in arithmetic dynamics
• Sparsity of stable primes for dynamical sequences
• Eventually stable quadratic polynomials over \(\mathbb{Q}\)
• Newly reducible polynomial iterates

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The explicit construction of irreducible polynomials over finite fields 👍 👎
• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots 👍 👎
• A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields 👍 👎
• Recursive constructions of irreducible polynomials over finite fields 👍 👎
• Integer Polynomials that are Reducible Modulo all Primes 👍 👎
• On the reduction modulo \(p\) of absolutely irreducible polynomials 👍 👎
• A recurrent construction of irreducible polynomials of fixed degree over finite fields 👍 👎
• Distribution of primitive and irreducible polynomials modulo a prime number 👍 👎

This page was built for publication: An iterative construction of irreducible polynomials reducible modulo every prime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946103)