Counting points of bounded height in monoid orbits (Q2152836)

Consider a set of endomorphisms on \(\mathbb{P}^N\). The author investigates the problem of counting points of bounded height in monoid (or semigroup) orbits in \(\mathbb{P}^N\) by counting all of the points of bounded height obtained by applying all possible compositions of maps within a fixed set \(S\) to a given initial point \(P\). In fact, the main result in this paper is the following: Theorem. Let \({M_S}\) be the monoid generated under composition by a set \(S=\{\phi_1,\phi_2,\dots,\phi_s\}\) of endomorphisms of \(\mathbb{P}^N\) defined over \(\overline{\mathbb Q}\) with distinct degrees at least two. If \({M_S}\) is free, then for all \(\epsilon >0\) there exists an effectively computable positive constant \(b=b(s, \epsilon)\) and a constant \(B_s\) depending only on \(S\) such that \[ (\log B)^b \ll \# \{f \in M_s: H(f(P)) \leq B\} \ll (\log B)^{b+ \epsilon} \] holds for all \(P \in \mathbb{P}^N(\overline{\mathbb Q})\) with \(H(P) > B_s\). Moreover, the implicit constants and error terms depend on \(P\) and are effectively computable if \(B_S\) is. Furthermore, it is proved that most sets of rational functions in one variable satisfy these more refined bounds. In fact, the author gives several remarks and conjectures concerning the number of points (not functions) of bounded height in total orbits associated to free monoids.