{'fraction_non_alphanumeric': 0.06270996640537514, 'fraction_numerical': 0.03471444568868981, 'mean_word_length': 5.04054054054054, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Billiards in regular 2n‐gons and the self‐dual induction

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.