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.