The proportion of $k$-cycles for polynomials modulo primes
Jonathan Root

TL;DR
This paper investigates the distribution of cycle lengths in polynomial iterations over finite fields, establishing bounds on the density of primes where a polynomial exhibits a k-cycle, and providing explicit polynomial families with this property.
Contribution
It proves that for many polynomials, the density of primes with a k-cycle is at most 1/k, and constructs infinite polynomial families with this characteristic.
Findings
Density of primes with a k-cycle is at most 1/k for many polynomials.
Constructs infinite families of polynomials with the property.
Provides bounds on the distribution of cycle lengths in polynomial dynamics over finite fields.
Abstract
Let , and define the orbit of under the iteration of to be the set \[ \mathcal{O}(x):=\{x,f(x),(f\circ f)(x),(f\circ f\circ f)(x),\dots\}. \] An orbit is a -cycle if it is periodic of length . In this paper we fix a polynomial with integer coefficients and for each prime we consider obtained by reducing the coefficients of modulo . We ask for the density of primes such that has a -cycle in . We prove that in many cases the density is at most . We also give an infinite family of polynomials in each degree with this property.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Meromorphic and Entire Functions · Advanced Mathematical Identities
