Improved mixing rates for infinite measure-preserving systems

2013 ◽  
Vol 35 (2) ◽  
pp. 585-614 ◽  
Author(s):  
DALIA TERHESIU

AbstractIn this work, we introduce a new technique for operator renewal sequences associated with dynamical systems preserving an infinite measure that improves the results on mixing rates obtained by Melbourne and Terhesiu [Operator renewal theory and mixing rates for dynamical systems with infinite measure. Invent. Math. 1 (2012), 61–110]. Also, this technique allows us to offer a very simple proof of the key result of Melbourne and Terhesiu that provides first-order asymptotics of operator renewal sequences associated with dynamical systems with infinite measure. Moreover, combining techniques used in this work with techniques used by Melbourne and Terhesiu, we obtain first-order asymptotics of operator renewal sequences under some relaxed assumption on the first return map.

2015 ◽  
Vol 15 (02) ◽  
pp. 1550012 ◽  
Author(s):  
Ian Melbourne

In a recent paper, Melbourne and Terhesiu [Operator renewal theory and mixing rates for dynamical systems with infinite measure, Invent. Math.189 (2012) 61–110] obtained results on mixing and mixing rates for a large class of noninvertible maps preserving an infinite ergodic invariant measure. Here, we are concerned with extending these results to the invertible setting. Mixing is established for a large class of infinite measure invertible maps. Assuming additional structure, in particular exponential contraction along stable manifolds, it is possible to obtain good results on mixing rates and higher order asymptotics.


Antiquity ◽  
1990 ◽  
Vol 64 (244) ◽  
pp. 562-567 ◽  
Author(s):  
E. Glover ◽  
I. Glover ◽  
C. Vita-Finzi

A new technique of radiocarbon dating is presented, offering at modest expense the means to a determination that is good to the ‘first order’ of magnitude


10.29007/t4gz ◽  
2018 ◽  
Author(s):  
Geoff Hamilton ◽  
Morten Heine Sørensen

A program transformation technique should terminate, return efficient output programs and be efficient itself.For positive supercompilation ensuring termination requires memoisation of expressions, and these are subsequently used to determine when to perform generalization and folding. For a first-order language, every infinitesequence of transformation steps must include function unfolding, so it is sufficient to memoise only those expressions immediately prior to a function unfolding step.However, for a higher-order language, it is possible for an expression to have an infinite sequence of transformation steps which do not include function unfolding, so memoisation prior to a function unfolding step is not sufficient by itselfto ensure termination. But memoising additional expressions is expensive during transformation and may lead to less efficient output programs due to auxiliary functions. This additional memoisation may happen explicitly during transformationor implicitly via a pre-processing transformation as outlined in previous work by the first author.We introduce a new technique for local driving in higher-order positive supercompilation which obliviates the need for memoising other expressions than function unfolding steps, thereby improving efficiency of both the transformation and the generated programs. We exploit the fact, due to the second author in the setting of type-free lambda-calculus that every expression with an infinite sequence of transformation steps not involving function unfolding must have somthing like the term Omega = (lambda x. x x) (lambda x . x x) embedded within it in a certain sense. The technique has proven useful on a host of examples.


Sign in / Sign up

Export Citation Format

Share Document