pith. sign in

arxiv: 1612.05334 · v1 · pith:JCINZ3WNnew · submitted 2016-12-16 · 🧮 math.DS

Hochman's upcrossing theorem for groups of polynomial growth

classification 🧮 math.DS
keywords mathbbhochmansubsetalphabetagroupsgrowthintervals
0
0 comments X
read the original abstract

Consider a stochastic process $(S_{[a_i,b_i]})_{[a_i,b_i] \subset \mathbb{N}}$, which is indexed by the collection of all nonempty intervals $[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 $k \geq 1$ and any interval $(\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]})_{n \geq 1}$ has at least $k$ fluctuations over $(\alpha,\beta)$. It was also noticed that a similar techniques can be applied in $\mathbb{Z}^d$ case. In this article we extend Hochman's upcrossing theorem to groups of polynomial growth.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.