Counting the number of $m$-periodic $\mathcal{O}_{K}$-points of a discrete dynamical system with applications from arithmetic statistics, V
Brian Kintu

TL;DR
This paper investigates the distribution of $m$-periodic points in polynomial dynamical systems over number fields, revealing unbounded and bounded average behaviors and connecting these to deep number-theoretic and statistical properties.
Contribution
It provides new results on the average number of $m$-periodic points for specific polynomial maps over number fields, linking dynamical systems with arithmetic statistics and density theorems.
Findings
Average number of $m$-periodic points can be unbounded or zero as $c$ varies.
For certain maps, the average number of $m$-periodic points is 0, 1, or 2.
Connections established between dynamical periodic points and algebraic number theory, including Artin $L$-functions.
Abstract
In this follow-up paper, we again inspect a surprising relationship between the set of -periodic points of a polynomial map defined by for all and the coefficient , where is any number field of degree , is an integer and is any fixed (period). As before, we again study counting problems which are inspired by advances on -torsion point-counting in arithmetic statistics and -periodic point-counting in arithmetic dynamics. In doing so, we then first prove that for any prime and for any fixed and (period) , the average number of distinct -periodic integral points of any modulo prime ideal is unbounded or zero as tends to infinity. Motivated…
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.
