2013
DOI: 10.1112/blms/bdt049
|View full text |Cite
|
Sign up to set email alerts
|

ABC implies primitive prime divisors in arithmetic dynamics

Abstract: Let K be a number field, let ϕ(x) ∈ K(x) be a rational function of degree d > 1, and let α ∈ K be a wandering point such that ϕ n (α) = 0 for all n > 0. We prove that if the abc-conjecture holds for K, then for all but finitely many positive integers n, there is a prime p of K such that v p (ϕ n (α)) > 0 and vp(ϕ m (α)) 0 for all positive integers m < n. Under appropriate ramification hypotheses, we can replace the condition v p (ϕ n (α)) > 0 with the stronger condition vp(ϕ n (α)) = 1. We prove the same resul… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
117
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 50 publications
(118 citation statements)
references
References 36 publications
1
117
0
Order By: Relevance
“…The fact that there are infinitely many such primes follows from [Sil93]. Various authors (see [Zsi92,Elk91,Ric07,Kri13,IS09,FG11,GNT13] for example) have sought to show that not only are there infinitely many primes that divide φ n (α) − β for some n, but the stronger statement that there exists an N such that for all n > N, there is a prime that divides φ n (α)−β that does not divide φ m (α)−β for any m < n. If this is true, one might say that there are infinitely many primes dividing φ n (α) − β for some n because after a certain point each "new iterate" φ n (α) − β gives a "new prime" dividing φ n (α) − β. This is sometimes referred as the "Zsigmondy principle", after Zsigmondy [Zsi92] who studied these questions in the context of primitive divisors of a n − b n .…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…The fact that there are infinitely many such primes follows from [Sil93]. Various authors (see [Zsi92,Elk91,Ric07,Kri13,IS09,FG11,GNT13] for example) have sought to show that not only are there infinitely many primes that divide φ n (α) − β for some n, but the stronger statement that there exists an N such that for all n > N, there is a prime that divides φ n (α)−β that does not divide φ m (α)−β for any m < n. If this is true, one might say that there are infinitely many primes dividing φ n (α) − β for some n because after a certain point each "new iterate" φ n (α) − β gives a "new prime" dividing φ n (α) − β. This is sometimes referred as the "Zsigmondy principle", after Zsigmondy [Zsi92] who studied these questions in the context of primitive divisors of a n − b n .…”
Section: Introductionmentioning
confidence: 99%
“…As in [GNT13], normalizing by the degree of the number field will make it easier to state proofs in the same way for both number fields and function fields.…”
Section: Number Field Andmentioning
confidence: 99%
See 3 more Smart Citations