Ergodic theorems with arithmetical weights
Abstract
We prove that the divisor function d(n) counting the number of divisors of the integer n, is a good weighting function for the pointwise ergodic theorem. For any measurable dynamical system (X, A,,τ) and any f∈ Lp(), p>1, the limit n ∞1 Σk=1n d(k) Σk=1n d(k)f(τk x) exists -almost everywhere. We also obtain similar results for other arithmetical functions, like θ(n) function counting the number of squarefree divisors of n and the generalized Euler totient function Js(n), s>0. We use Bourgain's method, namely the circle method based on the shift model.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.