Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 5 min ago
PreprintarXiv licencearXiv

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

Abstract

Let f,g∈ℂ[z]∖ℂ and c∈ℂ[z]. Suppose that deg(c)=1 if deg(f)=deg(g)=1. Using the theory of Presburger arithmetic, we prove that the rank-two recurrence set Sf,g,c2:={(m,n)∈ℤ≥02: ∃λ∈ℂ, f∘ m(λ)=g∘ n(λ)=c(λ)} 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. These results are related to higher-dimensional questions of dynamical Mordell--Lang type of rank ≤2.

Related

  1. On Dynamical Mordell-Lang Conjecture for Split Map
    Zhang Yuanming
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. The Dynamical Mordell--Lang Conjecture for Relatively Étale Systems over Products of Curves
    Bhawesh Mishra
    arXivPreprintCC BY-NC-SA 4.0Full textAlgebra & number theoryDynamical systemsarXiv
  3. Dynamical Mordell--Lang Conjecture for Higher-Rank Radially Ramified Skew Products
    Bhawesh Mishra
    arXivPreprintCC BY-NC-SA 4.0Full textAlgebra & number theoryDynamical systemsarXiv
  4. Local height arguments toward the dynamical Mordell-Lang conjecture
    She Yang, Aoyang Zheng
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryDynamical systemsarXiv
  5. Classification of the hypergeometric orthogonal polynomials via their recurrence coefficients
    Luis Verde-Star
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
BibTeX
@misc{zhang2026ranktwo,
  title = {{Rank-two recurrence results for polynomials and questions of dynamical Mordell--Lang type}},
  author = {Geng-Rui Zhang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2605.27058},
  eprint = {2605.27058},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.27058},
}
RIS
TY  - UNPB
TI  - Rank-two recurrence results for polynomials and questions of dynamical Mordell--Lang type
AU  - Geng-Rui Zhang
PY  - 2026
DA  - 2026/10/06
PB  - arXiv
DO  - 10.48550/arxiv.2605.27058
UR  - https://arxiv.org/abs/2605.27058
AB  - Let f,g∈ℂ[z]∖ℂ and c∈ℂ[z]. Suppose that deg(c)=1 if deg(f)=deg(g)=1. Using the theory of Presburger arithmetic, we prove that the rank-two recurrence set S_f,g,c^2:={(m,n)∈ℤ_≥0^2: ∃λ∈ℂ, f^∘ m(λ)=g^∘ n(λ)=c(λ)} 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. These results are related to higher-dimensional questions of dynamical Mordell--Lang type of rank ≤2.
ER  -