Generalized iterations and primitive divisors (Q746942)

This work is concerned with a class of one-dimensional arithmetical dynamical systems obtained by selecting an arbitrary infinite sequence of Chebyshev polynomials (of degree at least two), and then iterating them over the rationals -- in the sense of function composition -- in the order prescribed by the sequence. This construct (which reduces to ordinary iteration if the sequence is periodic) has appeared in various guises in dynamical system theory, but not in arithmetic dynamics. Given a rational initial condition which is not eventually periodic, one constructs the sequence of numerators \(a_j\) of the points of the orbit. The author considers the Zsigmondi set of this sequence, namely the set of indices \(j\) for which \(a_j\) does not have any primitive divisor (a prime divisor that does not divide any previous element of the sequence). The author proves that the Zsigmondi set is finite, generalising a result of \textit{P. Ingram} and \textit{J. H. Silverman} [Math. Proc. Camb. Philos. Soc. 146, No. 2, 289--302 (2009; Zbl 1242.11012)] for the iteration of a single map over number fields. The proof makes use of canonical height functions, developing tools which are applicable to more general families of commuting maps.