arXiv · 2605.27058
Rank-two recurrence results for polynomials and questions of dynamical Mordell--Lang type
Abstract
Let $f,g\in\mathbb{C}[z]\setminus\mathbb{C}$ and $c\in\mathbb{C}[z]$. Suppose that $\mathrm{deg}(c)=1$ if $\mathrm{deg}(f)=\mathrm{deg}(g)=1$. Using the theory of Presburger arithmetic, we prove that the rank-two recurrence set \[S_{f,g,c}^2:=\left\lbrace(m,n)\in\mathbb{Z}_{\geq0}^2\colon \exists\lambda\in\mathbb{C}, f^{\circ m}(\lambda)=g^{\circ n}(\lambda)=c(\lambda)\right\rbrace\] is semi-linear. This is a generalization of a theorem of Yang and Zhong for the case $m=n$. We also obtain partial results on recurrence sets for rational maps in the case $m=n$. These results are related to higher-dimensional questions of dynamical Mordell--Lang type of rank $\leq2$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Geng-Rui Zhang. 2026-05-26. Rank-two recurrence results for polynomials and questions of dynamical Mordell--Lang type. https://arxiv.org/abs/2605.27058
Cite the original work for its findings. Save a collection to share your selection of sources.