Integer-valued o-minimal functions
Abstract
We study Ran,-definable functions f:R R that take integer values at all sufficiently large positive integers. If |f(x)|= O(2(1+10-5)x), then we find polynomials P1, P2 such that f(x)=P1(x)+P2(x)2x for all sufficiently large x. Our result parallels classical theorems of P\'olya and Selberg for entire functions and generalizes Wilkie's classification for the case of |f(x)|= O(Cx), for some C<2. Let k∈ N and γk=Σj=1k 1/j. Extending Wilkie's theorem in a separate direction, we show that if f is k-concordant and |f(x)|= O(Cx), for some C<eγk+1, then f must eventually be given by a polynomial. This is an analog of a result by Pila for entire functions.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.