Setwise Distinguishable Permutations

Ishay Haviv

A family of permutations of $[n]$ is called setwise distinguishable if for every permutation in the family there exists a subset of $[n]$ whose image under this permutation differs…