On multiplicative independence of rational function iterates (Q2173236)

In Theorem 1.1 the author gives lower bounds for the degree of multiplicative combinations of iterates of rational functions over a general field, which establish the multiplicative independence of such iterates (Corollary 1.2). In Theorem 1.3 the author studies the polynomial case and obtains a lower bound on the number of distinct zeros of a multiplicative combination of iterates. Moreover, Corollary 1.2 is used to generalise a result of \textit{S. Gao} [Proc. Am. Math. Soc. 127, No. 6, 1615--1623 (1999; Zbl 0923.11166)] for constructing elements in the finite field \(\mathbb{F}_{q^n}\) whose orders are larger than any polynomial in \(n\) when \(n\) becomes large (Theorem 1.4). Finally, the author studies the finiteness of polynomials which translate a given finite set of polynomials to become multiplicatively dependent; Corollary 1.6.