English

Hochman's upcrossing theorem for groups of polynomial growth

Dynamical Systems 2016-12-19 v1

Abstract

Consider a stochastic process (S[ai,bi])[ai,bi]N(S_{[a_i,b_i]})_{[a_i,b_i] \subset \mathbb{N}}, which is indexed by the collection of all nonempty intervals [ai,bi]N[a_i,b_i] \subset \mathbb{N} and which is stationary under translations of the intervals. It was shown by M. Hochman that, for any k1k \geq 1 and any interval (α,β)R(\alpha,\beta) \subset \mathbb{R}, one can give an `almost-exponential' bound on the size of the set where the associated process (S[1,n])n1(S_{[1,n]})_{n \geq 1} has at least kk fluctuations over (α,β)(\alpha,\beta). It was also noticed that a similar techniques can be applied in Zd\mathbb{Z}^d case. In this article we extend Hochman's upcrossing theorem to groups of polynomial growth.

Keywords

Cite

@article{arxiv.1612.05334,
  title  = {Hochman's upcrossing theorem for groups of polynomial growth},
  author = {Nikita Moriakov},
  journal= {arXiv preprint arXiv:1612.05334},
  year   = {2016}
}

Comments

18 pages, minor overlap with arXiv:1608.05033, comments are welcome