Abstract

We build a coding of the trajectories of billiards in regular 2n-gons, similar but different from the one in J. Smillie and C. Ulcigrai [in ‘Beyond Sturmian sequences: coding linear trajectories in the regular octagon’, Proc. Lond. Math. Soc. (3) 102 (2011) 291–340], by applying the self-dual induction [S. Ferenczi and L.Q. Zamboni, ‘Structure of K-interval exchange transformations: induction, trajectories, and distance theorems’, J. Anal. Math. 112 (2010) 289–328] to the underlying one-parameter family of n-interval exchange transformations. This allows us to show that, in that family, for n=3 non-periodicity is enough to guarantee weak mixing, and in some cases minimal self-joinings, and for every n we can build examples of n-interval exchange transformations with weak mixing, which are the first known explicitly for n>6.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.