Given a fixed dimension $d$, say $d=2$ we want the following: Input: $A_1\ldots A_m$: $m$ arrays of length $n$ of integers Each input array $A_i$ must be a permutation of the numbers $1..n$, so in each array each number from $1$ to $n$ appears exactly once. Output: For each tuple (pairs in the ca...