Skip to content
DraconiticResearch
Search Sources API
197,783 studies31 sourcesUpdated 31 min ago
PreprintCC BY 4.0arXiv

Very sparse return sets in arithmetic dynamics

Abstract

When studying the dynamical Mordell-Lang conjecture by using the p-adic method, experts have found that return sets of the p-adic version of the DML problem can be very sparse. In this article, we investigate the similar phenomenon for a complex analytic version of the DML problem and the DML problem for backward orbits.

Related

  1. Sparse k-AP Covering Sets and the Arithmetic Kakeya Conjecture
    Pitchayut Saengrungkongka
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. Return Time Sets of Minimal Points for Countable Group Actions
    Jian Li, Yini Yang
    arXivPreprintarXiv licenceFull textDynamical systemsarXiv
  3. Controlling The Skips of Arithmetic Sets
    Taeyoung Em
    arXivPreprintCC BY-NC-SA 4.0Full textLogic & foundationsarXiv
  4. One equation allocates playing time in competitive team sports: the rulebook sets the arithmetic and the league sets the habit
    Gustavo Pedro Ricou
    arXivPreprintarXiv licenceFull textStatisticsStatistical & nonlinear physicsarXiv
  5. Elliptic Superlevel Sets in the Class OOC: Boundary-Layer Geometry and Stability of the Return Map
    Mohamed El Morsalani, Mohammd Barkatou
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
BibTeX
@misc{yang2026very,
  title = {{Very sparse return sets in arithmetic dynamics}},
  author = {She Yang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.32181},
  eprint = {2609.32181},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.32181},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Very sparse return sets in arithmetic dynamics
AU  - She Yang
PY  - 2026
DA  - 2026/09/26
PB  - arXiv
DO  - 10.48550/arxiv.2609.32181
UR  - https://arxiv.org/abs/2609.32181
AB  - When studying the dynamical Mordell-Lang conjecture by using the p-adic method, experts have found that return sets of the p-adic version of the DML problem can be very sparse. In this article, we investigate the similar phenomenon for a complex analytic version of the DML problem and the DML problem for backward orbits.
ER  -