On the size of pairwise-colliding permutations
János Körner, Chandra Nair, David Chi-Heng Ng · 2019
A structured code that improves the previously best known exponential asymptotic lower bound for the maximum cardinality of a pairwise-colliding set of permutations is presented. The main contribution is an explicit construction of an infinite recursion of pairwise-colliding sets of partial-permutations.