Sharp polynomial estimates for the decay of correlations (Q1885585): Difference between revisions

The author generalizes the method developed by \textit{O. M. Sarig} [Invent. Math. 150, 629--653 (2002; Zbl 1042.37005)] to obtain polynomial lower bounds for correlation functions for maps with a countable Markov partition. As a result, the author shows that the estimates on towers obtained by \textit{L.-S. Young} [Isr. J. Math. 110, 153--188 (1999; Zbl 0983.37005)] are optimal. He also shows that for functions with zero average, the decay rate can be improved by a factor of \(1/n\), this implies a central limit theorem in contexts where it was not expected, e.g., \(x\mapsto x+Cx^{1+\alpha}\) for \(1/2\leq \alpha <1\). The method used is based on a general result on renewal sequences of operators.