Search arXivSearch

arXiv · 2505.24565

Counting the number of $\mathbb{Z}_{p}$-and $\mathbb{F}_{p}[t]$-fixed points of a discrete dynamical system with applications from arithmetic statistics, III

Abstract

In this follow-up paper, we again inspect a surprising relationship between the set of fixed points of a polynomial map $φ_{d, c}$ defined by $φ_{d, c}(z) = z^d + c$ for all $c, z \in \mathcal{O}_{K}$ or $\in \mathbb{Z}_{p}$ or $\in \mathbb{F}_{p}[t]$ and the coefficient $c$, where $K$ is any number field of degree $n > 1$, $p>2$ is any prime, $\mathbb{Z}_{p}$ (resp., $\mathbb{F}_{p}[t]$) is the ring of all $p$-adic integers (resp., the ring of all polynomials over a finite field $\mathbb{F}_{p}$) and $d>2$ is an integer. As before, we again wish to study counting problems which are inspired by advances in arithmetic statistics, and also by Narkiewicz on totally complex $K$-periodic points along with Adam-Fares on $\mathbb{Q}_{p}$-periodic points in arithmetic dynamics. In doing so, we then first prove that for any prime $p\geq 3$ and for any $\ell \in \mathbb{Z}_{\geq 1}$, the average number of distinct fixed points of any $φ_{p^{\ell}, c}$ modulo prime $p\mathcal{O}_{K}$ (modulo $p\mathbb{Z}_{p}$) is bounded or zero or unbounded as $c\to \infty$ . Motivated further by $\mathbb{F}_{p}(t)$-periodic point-counting result of Benedetto in arithmetic dynamics, we then also find that the average number of fixed points in $\mathbb{F}_{p}[t]$-setting behaves in the same way as in $\mathcal{O}_{K}$-setting. Finally, we then apply here counting and statistical results from arithmetic statistics, and as a result obtain counting and statistical results on irreducible monic ($p$-adic) integer polynomials, number fields and subfields of global function fields arising naturally in our polynomial discrete dynamical settings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Brian Kintu. 2026-01-13. Counting the number of $\mathbb{Z}_{p}$-and $\mathbb{F}_{p}[t]$-fixed points of a discrete dynamical system with applications from arithmetic statistics, III. https://arxiv.org/abs/2505.24565

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT