Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 1 min ago
PreprintCC BY 4.0arXiv

Classification of the Orbits of Three Quadratic Collatz-type Maps

Abstract

We study three quadratic Collatz-type maps on the non-negative integers. Each of them halves an even number, and they send an odd n to n(n−1)/2, to n(n+1)/2 and to (n2 − 1)/4, respectively. Along an orbit, the odd terms grow until they reach a number of the form 2m + 1 or 2m − 1, depending on the map, and an orbit with an odd term greater than $1$ is bounded exactly when this happens. The step that reaches such a number gives a solution of an exponential Diophantine equation, which becomes the equation 2a ± 2b + 1 = z2 after completing the square. With Szalay's classification of the solutions of this equation, we classify all orbits of the maps. Every orbit either is eventually periodic or tends to infinity, and we determine exactly the initial values with bounded orbits. For the map with odd branch n(n−1)/2, Sedaghat stated the classification, and we give a new and complete proof. For this map, we also give an elementary criterion for unbounded orbits, based on divisibility alone. To our knowledge, the classifications for the other two maps are new.

Related

  1. Parity-Word Complexity and Exponent Growth in Non-Bounded Collatz Orbits
    Hassan Douzi
    HALPreprintCC BY-NC-ND 4.0Full textGeneral mathematicsHAL
  2. Brownian motion in Collatz orbits
    David Leen
    Zenodo (CERN European Organization for Nuclear Research)PreprintCC BY5 citedAlgebra & number theoryOpenAlex
  3. The stochastic 3x+1 model is a theorem: Brownian structure of Collatz orbits
    David Leen
    Zenodo (CERN European Organization for Nuclear Research)PreprintCC BY6 citedMathematical physicsOpenAlex
  4. Finite-Sample Rigidity for Left-Translated Similarity Orbits and Off-Diagonal Quadratic Realizations
    Hiroki Minamide
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. Quadratic-Defect Completions of Spherical $2$-Design Orbits
    Kuan-Cheng Chien, Ming-Hsuan Kang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{ye2026classification,
  title = {{Classification of the Orbits of Three Quadratic Collatz-type Maps}},
  author = {Xuda Ye},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.10660},
  eprint = {2610.10660},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.10660},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Classification of the Orbits of Three Quadratic Collatz-type Maps
AU  - Xuda Ye
PY  - 2026
DA  - 2026/10/07
PB  - arXiv
DO  - 10.48550/arxiv.2610.10660
UR  - https://arxiv.org/abs/2610.10660
AB  - We study three quadratic Collatz-type maps on the non-negative integers. Each of them halves an even number, and they send an odd n to n(n−1)/2, to n(n+1)/2 and to (n^2 − 1)/4, respectively. Along an orbit, the odd terms grow until they reach a number of the form 2^m + 1 or 2^m − 1, depending on the map, and an orbit with an odd term greater than $1$ is bounded exactly when this happens. The step that reaches such a number gives a solution of an exponential Diophantine equation, which becomes the equation 2^a ± 2^b + 1 = z^2 after completing the square. With Szalay's classification of the solutions of this equation, we classify all orbits of the maps. Every orbit either is eventually periodic or tends to infinity, and we determine exactly the initial values with bounded orbits. For the map with odd branch n(n−1)/2, Sedaghat stated the classification, and we give a new and complete proof. For this map, we also give an elementary criterion for unbounded orbits, based on divisibility alone. To our knowledge, the classifications for the other two maps are new.
ER  -