arXiv (All)
open access
Rank-two recurrence results for polynomials and questions of dynamical Mordell--Lang type
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λ\
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Crepant resolutions of four-dimensional finite quotients#1341843
- Holomorphic curves of finite lower order with few inflection points#1142333
- On the monomials of Poincaré Series of negative index#1064953
- Co-rank $1$ Arithmetic Siegel--Weil IV: Analytic local-to-global#1297974
- Co-rank $1$ Arithmetic Siegel--Weil I: Local non-Archimedean#1354059
Record · ID 1216315
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive