Dynamical GCD Problems and a Variant of the Dynamical Mordell-Lang Conjecture

TL;DR

This paper advances the understanding of dynamical GCD problems by developing a new approach for automorphisms, strengthening previous results, and connecting these problems to a higher-dimensional Dynamical Mordell-Lang Conjecture, especially for algebraic group actions and polynomials.

Contribution

It introduces a more powerful method for automorphism cases, strengthens existing theorems, and relates dynamical GCD problems to a generalized conjecture in algebraic dynamics.

Findings

New approach for automorphism case of dynamical GCD

Complete answers to questions from previous studies

Established the conjecture for algebraic group actions and polynomial maps

Abstract

In \cite{NZ25}, the authors resolved the rational function analogue of the finiteness results for greatest common divisors of iterates of polynomials established in \cite{HT17}. These results may be viewed as dynamical generalizations of a classical problem concerning upper bounds for the greatest common divisors (GCDs) of two integer sequences studied by Bugeaud, Corvaja, and Zannier. The most delicate case arises when the maps involved are automorphisms, where the methods of \cite{NZ25} and \cite{HT17} rely heavily on Diophantine approximation and asymptotic analysis. In the present paper, we develop an alternative approach to the automorphism case. This method is more powerful, allowing us to give complete answers to the further questions posed in \cite{HT17}. In particular, we strengthen the main theorem of \cite{HT17} and provide an alternative proof of the main theorem of \cite{NZ25} in the automorphism setting. Moreover, we relate this dynamical GCD problem to a special case of a higher-dimensional generalization of the Dynamical Mordell--Lang Conjecture proposed by Junyi Xie. We establish this generalized conjecture when the dynamics arise from algebraic group actions. In addition, we resolve the corresponding special case associated with dynamical GCD questions when the maps involved are polynomials.