We consider the problem of efficiently constructing an as large as possible family of permutations such that each pair of permutations are far part (i.e., disagree on a constant fraction of their inputs).
Specifically, for every n\in\N, we present a collection of N=N(n)=(n!)^{\Omega(1)} pairwise far apart permutations \{\pi_i:[n]\to[n]\}_{i\in[N]} and ... more >>>