English

Rank-two recurrence results for polynomials and questions of dynamical Mordell--Lang type

Dynamical Systems 2026-05-27 v1 Algebraic Geometry Logic Number Theory

Abstract

Let f,gC[z]Cf,g\in\mathbb{C}[z]\setminus\mathbb{C} and cC[z]c\in\mathbb{C}[z]. Suppose that deg(c)=1\mathrm{deg}(c)=1 if deg(f)=deg(g)=1\mathrm{deg}(f)=\mathrm{deg}(g)=1. Using the theory of Presburger arithmetic, we prove that the rank-two recurrence set Sf,g,c2:={(m,n)Z02 ⁣:λC,fm(λ)=gn(λ)=c(λ)}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=nm=n. We also obtain partial results on recurrence sets for rational maps in the case m=nm=n. These results are related to higher-dimensional questions of dynamical Mordell--Lang type of rank 2\leq2.

Keywords

Cite

@article{arxiv.2605.27058,
  title  = {Rank-two recurrence results for polynomials and questions of dynamical Mordell--Lang type},
  author = {Geng-Rui Zhang},
  journal= {arXiv preprint arXiv:2605.27058},
  year   = {2026}
}

Comments

48 pages