Prime-powered images and irreducible polynomials in dynamical semigroups

Abstract

Let G= xd+c1,…,xd+cs be a semigroup generated under composition for some c1,…,cs∈Z and some d≥2. Then we prove that, outside of an exceptional one-parameter family, G contains a large and explicit subset of irreducible polynomials if and only if it contains at least one irreducible polynomial. In particular, this conclusion holds when G is generated by at least s≥3 polynomials when d is odd and at least s≥5 polynomials when d is even. To do this, we prove a classification result for prime powered iterates under f(x)=xd+c when c∈Z is nonzero. Namely, if fn(α)=yp for some n≥4, some α,y∈Z, and some prime p|d, then α and yp are necessarily preperiodic and periodic points for f respectively. Moreover, we note that n=4 is the smallest possible iterate for which one may make this conclusion.

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…