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

The Cycle Structure of Unicritical Polynomials

Abstract: A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime p, reduce its coefficients mod p and consider its action on the field F p . The questions of whether and in what sense these families are random have been studied extensively, spurred in part by Pollard's famous "rho" algorithm for integer factorization (the heuristic justification of which is the randomness of one such family). However, the cycle structure of these families cannot be random,… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 33 publications
0
1
0
Order By: Relevance
“…As an example of the utility of this approach, we recall that Pollard's famous "rho" method of factorization [Pol75] relies on an aspect of the purported randomness of the family of dynamical systems associated to R = Z and f = X 2 + 1. For recent work on this approach to studying randomness, see [JKMT16,BG17,BG20,Juu]. To ease notation, for any commutative ring R, we write P R for the nonzero prime ideals of R; moreover, if R is residually finite, then for any p ∈ P R , we write N (p) for [R] p .…”
Section: Introductionmentioning
confidence: 99%
“…As an example of the utility of this approach, we recall that Pollard's famous "rho" method of factorization [Pol75] relies on an aspect of the purported randomness of the family of dynamical systems associated to R = Z and f = X 2 + 1. For recent work on this approach to studying randomness, see [JKMT16,BG17,BG20,Juu]. To ease notation, for any commutative ring R, we write P R for the nonzero prime ideals of R; moreover, if R is residually finite, then for any p ∈ P R , we write N (p) for [R] p .…”
Section: Introductionmentioning
confidence: 99%