2015
DOI: 10.1093/imrn/rnv273
|View full text |Cite
|
Sign up to set email alerts
|

Wreath Products and Proportions of Periodic Points

Abstract: Abstract. Let ϕ : P 1 −→ P 1 be a rational map of degree greater than one defined over a number field k. For each prime p of good reduction for ϕ, we let ϕp denote the reduction of ϕ modulo p. A random map heuristic suggests that for large p, the proportion of periodic points of ϕp in P 1 (o k /p) should be small. We show that this is indeed the case for many rational functions ϕ.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
45
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 38 publications
(46 citation statements)
references
References 19 publications
(19 reference statements)
1
45
0
Order By: Relevance
“…As explained in [105], it seems unlikely that such a result holds in general, so we pose the problem of characterizing those maps for which there is such a result. There are a handful of published results giving upper bounds for the size of the orbit Of (P mod p), including [105,129,201]. To illustrate, we quote an easily stated corollary from one of these papers.…”
Section: Question 182 (Vague Motivating Question) To What Extent Domentioning
confidence: 99%
“…As explained in [105], it seems unlikely that such a result holds in general, so we pose the problem of characterizing those maps for which there is such a result. There are a handful of published results giving upper bounds for the size of the orbit Of (P mod p), including [105,129,201]. To illustrate, we quote an easily stated corollary from one of these papers.…”
Section: Question 182 (Vague Motivating Question) To What Extent Domentioning
confidence: 99%
“…For Corollary 2, we observe as above that the condition of the theorem holds under the assumption (3). The choice r = [(log log p)/(log 4)] − 1 will satisfy (3) when p A,C 1 and the theorem then yields # f r (F p ) p/r .…”
mentioning
confidence: 79%
“…His result does not include an explicit dependence on r . Juul et al [3] handled general rational functions rather than restricting to quadratic polynomials. Their emphasis is on the reductions Before discussing the implications of the theorem, let us examine the condition that f i (0) = f j (0) for 0 i < j r .…”
Section: Iteration Of Quadratic Polynomials Over Finite Fields 1043mentioning
confidence: 99%
“…[50,38]. Let us mention one further result [29,Thm. 1.5 & Example 7.2]: for the graph of a quadratic polynomial with integer coefficients, the value of lim inf p→+∞ #{x ∈ F p belongs to a cycle of D f mod p }/p is 0 for x 2 + 1 but 1/4 for x 2 − 2.…”
Section: Introductionmentioning
confidence: 97%