z-logo
Premium
The density of prime divisors in the arithmetic dynamics of quadratic polynomials
Author(s) -
Jones Rafe
Publication year - 2008
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/jlms/jdn034
Subject(s) - mathematics , iterated function , irreducibility , polynomial , orbit (dynamics) , quadratic equation , prime (order theory) , discrete mathematics , integer (computer science) , zero (linguistics) , pure mathematics , combinatorics , mathematical analysis , geometry , engineering , aerospace engineering , linguistics , philosophy , computer science , programming language
Let f ∈ ℤ[ x ], and consider the recurrence given by a n = f ( a n − 1 ), with a 0 ∈ ℤ. Denote by P ( f, a 0 ) the set of prime divisors of this recurrence, that is, the set of primes dividing at least one non‐zero term, and denote the natural density of this set by D ( P ( f, a 0 )). The problem of determining D ( P ( f, a 0 )) when f is linear has attracted significant study, although it remains unresolved in full generality. In this paper, we consider the case of f quadratic, where previously D ( P ( f, a 0 )) was known only in a few cases. We show that D ( P ( f, a 0 )) = 0 regardless of a 0 for four infinite families of f , including f = x 2 + k, k ∈ ℤ∖{−1}. The proof relies on tools from group theory and probability theory to formulate a sufficient condition for D ( P ( f, a 0 )) = 0 in terms of arithmetic properties of the forward orbit of the critical point of f . This provides an analogy to results in real and complex dynamics, where analytic properties of the forward orbit of the critical point have been shown to determine many global dynamical properties of a quadratic polynomial. The article also includes apparently new work on the irreducibility of iterates of quadratic polynomials.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here