Prime-powered images and irreducible polynomials in dynamical semigroups

Let $G=\langle x^d+c_1,\dots,x^d+c_s\rangle$ be a semigroup generated under composition for some $c_1,\dots,c_s\in\mathbb{Z}$ and some $d\geq2$. 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\geq3$ polynomials when $d$ is odd and at least $s\geq5$ polynomials when $d$ is even. To do this, we prove a classification result for prime powered iterates under $f(x)=x^d+c$ when $c\in\mathbb{Z}$ is nonzero. Namely, if $f^n(α)=y^p$ for some $n\geq4$, some $α,y\in\mathbb{Z}$, and some prime $p|d$, then $α$ and $y^p$ 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.

Publication Details

Journal
ArXiv.org
Published
2025-10-11
Primary Topic
semigroups and automata theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Prime-powered images and irreducible polynomials in dynamical semigroups

ArXiv.org
semigroups and automata theory
article

Prime-powered images and irreducible polynomials in dynamical semigroups

article en

Abstract

Let $G=\langle x^d+c_1,\dots,x^d+c_s\rangle$ be a semigroup generated under composition for some $c_1,\dots,c_s\in\mathbb{Z}$ and some $d\geq2$. 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\geq3$ polynomials when $d$ is odd and at least $s\geq5$ polynomials when $d$ is even. To do this, we prove a classification result for prime powered iterates under $f(x)=x^d+c$ when $c\in\mathbb{Z}$ is nonzero. Namely, if $f^n(α)=y^p$ for some $n\geq4$, some $α,y\in\mathbb{Z}$, and some prime $p|d$, then $α$ and $y^p$ 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.

ArXiv.org
Openalex Percentile: Top 42%
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.