English

Prime-powered images and irreducible polynomials in dynamical semigroups

Number Theory 2025-10-14 v1 Dynamical Systems

Abstract

Let G=xd+c1,,xd+csG=\langle x^d+c_1,\dots,x^d+c_s\rangle be a semigroup generated under composition for some c1,,csZc_1,\dots,c_s\in\mathbb{Z} and some d2d\geq2. Then we prove that, outside of an exceptional one-parameter family, GG 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 GG is generated by at least s3s\geq3 polynomials when dd is odd and at least s5s\geq5 polynomials when dd is even. To do this, we prove a classification result for prime powered iterates under f(x)=xd+cf(x)=x^d+c when cZc\in\mathbb{Z} is nonzero. Namely, if fn(α)=ypf^n(\alpha)=y^p for some n4n\geq4, some α,yZ\alpha,y\in\mathbb{Z}, and some prime pdp|d, then α\alpha and ypy^p are necessarily preperiodic and periodic points for ff respectively. Moreover, we note that n=4n=4 is the smallest possible iterate for which one may make this conclusion.

Keywords

Cite

@article{arxiv.2510.10310,
  title  = {Prime-powered images and irreducible polynomials in dynamical semigroups},
  author = {Aristaa Bhardwaj and Adrian Boyer-Paulet and Wade Hindes and Emma Qiu and Alexander Sun},
  journal= {arXiv preprint arXiv:2510.10310},
  year   = {2025}
}
R2 v1 2026-07-01T06:31:39.297Z