Table of Contents
Fetching ...

Shrinking targets versus recurrence: the quantitative theory

Jason Levesley, Bing Li, David Simmons, Sanju Velani

Abstract

Let $X = [0,1]$, and let $T:X\to X$ be an expanding piecewise linear map sending each interval of linearity to $[0,1]$. For $ψ:\mathbb N\to\mathbb R_{\geq 0}$, $x\in X$, and $N\in\mathbb N$ we consider the recurrence counting function \[ R(x,N;T,ψ) := \#\{1\leq n\leq N: d(T^n x, x) < ψ(n)\}. \] We show that for any $\varepsilon > 0$ we have \[ R(x,N;T,ψ) = Ψ(N)+O\left(Ψ^{1/2}(N) \ (\logΨ(N))^{3/2+\varepsilon}\right) \] for $μ$-almost all $x\in X$ and for all $N\in\mathbb N$, where $Ψ(N):= 2 \sum_{n=1}^N ψ(n)$. We also prove a generalization of this result to higher dimensions.

Shrinking targets versus recurrence: the quantitative theory

Abstract

Let , and let be an expanding piecewise linear map sending each interval of linearity to . For , , and we consider the recurrence counting function We show that for any we have for -almost all and for all , where . We also prove a generalization of this result to higher dimensions.

Paper Structure

This paper contains 9 sections, 11 theorems, 67 equations.

Key Result

Theorem 1.1

Let $(X,\mathcal{A},\mu,T)$ be a measure-preserving dynamical system and suppose that $T$ is exponentially mixing with respect to $\mu$. Let $\psi:\mathbb N\to\mathbb R_{\ge 0}$ be a real, positive function. Then, for any given $\varepsilon>0$, we have that for $\mu$-almost all $x\in X$, where

Theorems & Definitions (18)

  • Theorem 1.1
  • Theorem 1.2
  • Remark 2.1
  • Theorem 2.2
  • Theorem 2.3
  • Remark 2.4
  • Lemma 3.1
  • Remark 3.2
  • Proposition 3.3
  • Proposition 3.4
  • ...and 8 more