The proportion of k-cycles for polynomials modulo primes

Abstract

Let f(x) ∈ Fp[x], and define the orbit of x∈ Fp under the iteration of f to be the set \[ O(x):=\x,f(x),(f f)(x),(f f f)(x),…\. \] An orbit is a k-cycle if it is periodic of length k. In this paper we fix a polynomial f(x) with integer coefficients and for each prime p we consider f(x) p obtained by reducing the coefficients of f(x) modulo p. We ask for the density of primes p such that f(x) p has a k-cycle in Fp. We prove that in many cases the density is at most 1/k. We also give an infinite family of polynomials in each degree with this property.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…