Counting the number of Zp-and Fp[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) = zd + c for all c, z ∈ OK or ∈ Zp or ∈ Fp[t] and the coefficient c, where K is any number field of degree n > 1, p>2 is any prime, Zp (resp., Fp[t]) is the ring of all p-adic integers (resp., the ring of all polynomials over a finite field Fp) 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 Qp-periodic points in arithmetic dynamics. In doing so, we then first prove that for any prime p≥ 3 and for any ∈ Z≥ 1, the average number of distinct fixed points of any p, c modulo prime pOK (modulo pZp) is bounded or zero or unbounded as c ∞ . Motivated further by Fp(t)-periodic point-counting result of Benedetto in arithmetic dynamics, we then also find that the average number of fixed points in Fp[t]-setting behaves in the same way as in OK-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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.