Abstract

Using a criterion due to Bourgain [10] and the generalization of the self-dual induction defined in [19], for each primitive permutation we build a large family of k-interval exchanges satisfying Sarnak’s conjecture, and, for at least one permutation in each Rauzy class, smaller families for which we have weak mixing, which implies a prime number theorem, and simplicity in the sense of Veech.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call