We consider semigroup dynamical systems defined by several polynomials over a number field K, and the orbit (tree) they generate at a given point. We obtain finiteness results for the set of preperiodic points of such systems that fall in the cyclotomic closure of K. More generally, we consider the finiteness of initial points in the cyclotomic closure for which the orbit contains an algebraic integer of bounded house. This work extends previous results for classical obits generated by one polynomial over K obtained initially by Dvornicich and Zannier (for preperiodic points), and then by Chen and Ostafe (for roots of unity and elements of bounded house in orbits).
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a generalisation of Gao's method for constructing elements in the finite field F q n whose orders are larger than any polynomial in n when n becomes large. Additionally, we discuss the finiteness of polynomials which translate a given finite set of polynomials to become multiplicatively dependent.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.