English

Classifying Functions via growth rates of repeated iterations

Classical Analysis and ODEs 2024-09-11 v1

Abstract

In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, n+22n2n22n+2\to 2n\to 2^n\to 2^{\cdot^{\cdot^2}} (nn-times) etc. and their inverse functions x2,x/2,logx/log2,x-2, x/2, \log x/\log 2, etc. Based on this idea and some regularity conditions we define classes of functions, with x+2x+2, 2x2x, 2x2^x in the first three classes. We prove various properties of these classes which reveal their nature, including a `uniqueness' property. We exhibit examples of functions lying between consecutive classes and indicate how this implies these gaps are very `large'. Indeed, we suspect the existence of a continuum of such classes.

Keywords

Cite

@article{arxiv.2409.06661,
  title  = {Classifying Functions via growth rates of repeated iterations},
  author = {Titus Hilberdink},
  journal= {arXiv preprint arXiv:2409.06661},
  year   = {2024}
}

Comments

23 pages. To appear in Fundamenta Mathematicae