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
Brian Kintu

TL;DR
This paper investigates fixed points of polynomial maps over various rings, revealing their statistical behavior and applying these findings to count related algebraic structures in arithmetic dynamics.
Contribution
It establishes bounds and asymptotic behaviors for fixed points of polynomial maps over rings like _p[t] and _p, extending previous results and connecting to arithmetic statistics.
Findings
Average fixed points are bounded, zero, or unbounded as parameters grow.
Fixed point counts behave similarly over _p[t] and _p.
Results lead to counting algebraic structures like number fields and subfields.
Abstract
In this follow-up paper, we again inspect a surprising relationship between the set of fixed points of a polynomial map defined by for all or or and the coefficient , where is any number field of degree , is any prime, (resp., ) is the ring of all -adic integers (resp., the ring of all polynomials over a finite field ) and 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 -periodic points along with Adam-Fares on -periodic points in arithmetic dynamics. In doing so, we then first prove that for any prime and for any ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · advanced mathematical theories
