有限域上多项式$AX^d+C$的迭代
Iteration of Polynomials $AX^d+C$ Over Finite Fields
摘要:
对于多项式$f(X)=AX^d+C \in \mathbb{F}_p[X]$,若$A\neq 0$和$d\geq 2$满足$0\leq i<j\leq N$和$f^i(0)\neq f^j(0)$,则有$\#f^N(\mathbb{F}_p) \sim \frac{2p}{(d-1)N},$,其中$f^N$是$f$的第$N$次迭代.
英文摘要:
For a polynomial $f(X)=AX^d+C \in \mathbb{F}_p[X]$ with $A\neq 0$ and $d\geq 2$, we prove that if $d\;|\;p-1$ and $f^i(0)\neq f^j(0)$ for $0\leq i<j\leq N$, then $\#f^N(\mathbb{F}_p) \sim \frac{2p}{(d-1)N},$ where $f^N$ is the $N$-th iteration of $f$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。