Data underlying the publication: Circular sorting, strong complete mappings and wreath product constructions

This dataset contains the code and the computational results. In particular, (i) non-affine examples for permutations matching the extremal bound of t(n) = n - 2, for n prime, (ii) Python code that can be used to check that t(25)=22 by running extremal_permutations(25) and that can be used to find all permutations pi in S_{23} with t([pi]) = 21, (iii) Go code that can be used to check that t(25)=22 and to generate all permutations in S_{25} that are strong complete mappings and avoid cycles of lengths 2,3,4(,5) in all shifts, (iv) a table showcases the possible range for t(n), for all composite n <= 44, and (v) an easily parsable version of tn_bound_summary in json format.

本数据集包含代码与计算结果。具体如下：(i) 针对素数n，匹配极值界t(n)=n−2的非仿射置换示例；(ii) 可通过运行extremal_permutations(25)验证t(25)=22的Python代码，该代码还可用于找出对称群S_{23}中所有满足t([π])=21的置换π；(iii) 可用于验证t(25)=22，同时可生成S_{25}中所有强完全映射（strong complete mappings）且在所有移位操作下规避长度为2、3、4（及5）的循环的置换的Go代码；(iv) 展示所有不超过44的合数n对应的t(n)可能取值范围的表格；(v) 以易于解析的JSON格式存储的tn_bound_summary版本。