English

Generalized Collatz Maps with Almost Bounded Orbits

Dynamical Systems 2022-11-22 v2 Classical Analysis and ODEs Number Theory Probability

Abstract

If dividing by pp is a mistake, multiply by qq and translate, and so you'll live to iterate. We show that if we define a Collatz-like map in this form then, under suitable conditions on pp and qq, almost all orbits of this map attain almost bounded values. This generalizes a recent breakthrough result of Tao for the original Collatz map (i.e., p=2p=2 and q=3q=3). In other words, given an arbitrary growth function Nf(N)N\mapsto f(N) we show that almost every orbit of such map with input NN eventually attains a value smaller than f(N)f(N).

Keywords

Cite

@article{arxiv.2111.06170,
  title  = {Generalized Collatz Maps with Almost Bounded Orbits},
  author = {Felipe Gonçalves and Rachel Greenfeld and Jose Madrid},
  journal= {arXiv preprint arXiv:2111.06170},
  year   = {2022}
}
R2 v1 2026-06-24T07:34:56.722Z